#include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
vector <int> a[100010];
int par[100010], cnt, in[100010], out[100010], elr[100010], mx[100010];
vector < pair<int,int> > v[100010];
pair<int,int> dfs1(int x, int papa){
  int nxt;
  pair<int, int> tmp;
  for(int i=0; i<a[x].size(); ++i){
    nxt=a[x][i];
    if(nxt==papa)
      continue;
    tmp=dfs1(nxt, x);
    v[x].push_back(mk(tmp.fs, nxt));
    v[x].push_back(mk(tmp.sc, nxt));
  }
  v[x].push_back(mk(x, x));
  v[x].push_back(mk(-1,-1));
  sort(v[x].begin(), v[x].end());
  reverse(v[x].begin(), v[x].end());
  return mk(v[x][0].fs, v[x][1].fs);
}
void dfs(int x, int papa, pair<int,int> tmp){
  int nxt;
  if(papa!=-1){
    v[x].push_back(mk(tmp.fs, papa));
    v[x].push_back(mk(tmp.sc, papa));
  }
  sort(v[x].begin(), v[x].end());
  reverse(v[x].begin(), v[x].end());
  vector <int> c;
  for(int i=0; i<a[x].size(); ++i){
    nxt=a[x][i];
    if(nxt==papa)
      continue;
    c.clear();
    for(int j=0; j<4; ++j){
      if(v[x][j].sc!=nxt)
        c.push_back(v[x][j].fs);
      if(c.size()==2){
        dfs(nxt, x, mk(c[0],c[1]));
        break;
      }
    }
  }
}
void dfs2(int x, int papa){
  int nxt;
  par[x]=papa;
  elr[cnt]=x;
  in[x]=cnt;
  ++cnt;
  for(int i=0; i<a[x].size(); ++i){
    nxt=a[x][i];
    if(nxt==papa)
      continue;
    dfs2(nxt, x);
  }
  out[x]=cnt-1;
}
int lf, rt, pr1[400010], pr2[400010];
pair<int,int> val;
void push(int & x, int & y, int & z, int & c){
  if(z>x){
    y=max(x, c);
    x=z;
  }
  else if(z<x){
    y=max(y, z);
  }
  else{
    y=max(y, c);
  }
}
void updt(int x, int st, int nd){
  if(st>rt||nd<lf)
    return;
  if(pr2[x]>val.fs)
    return;
  if(st>=lf&&nd<=rt){
    push(pr1[x],pr2[x],val.fs,val.sc);
    return;
  }
  int md=(st+nd)/2;
  push(pr1[x*2],pr2[x*2],pr1[x],pr2[x]);
  push(pr1[x*2+1],pr2[x*2+1],pr1[x],pr2[x]);
  updt(x*2, st, md);updt(x*2+1, md+1, nd);
}
void init(int x, int st, int nd){
  pr1[x]=pr2[x]=-1;
  if(st==nd){
    return;
  }
  int md=(st+nd)/2;
  init(x*2, st, md);init(x*2+1, md+1, nd);
}
int qry(int x, int st, int nd){
  if(st>rt||nd<lf)
    return -1;
  if(st==nd){
    return pr2[x];
  }
  int md=(st+nd)/2;
  push(pr1[x*2],pr2[x*2],pr1[x],pr2[x]);
  push(pr1[x*2+1],pr2[x*2+1],pr1[x],pr2[x]);
  return max(qry(x*2, st, md), qry(x*2+1,md+1, nd));
}
void doo(int x){
  int nxt;
  vector <int> c;
  for(int i=0; i<a[x].size(); ++i){
    nxt=a[x][i];
    c.clear();
    for(int j=0; j<4; ++j){
      if(v[x][j].sc!=nxt)
        c.push_back(v[x][j].fs);
      if(c.size()==2){
        break;
      }
    }
    while(c.size()<2){
      c.push_back(-1);
    }
    if(nxt==par[x]){
      lf=0;rt=in[x]-1;val=mk(c[0],c[1]);
      updt(1,0,cnt-1);
      lf=out[x]+1;rt=cnt-1;val=mk(c[0], c[1]);
      updt(1,0,cnt-1);
    }
    else{
      lf=in[nxt];rt=out[nxt];val=mk(c[0], c[1]);
      updt(1,0,cnt-1);
    }
  }
  c.clear();
  for(int j=0; j<4; ++j){
    c.push_back(v[x][j].fs);
    if(c.size()==2){
      break;
    }
  }
  while(c.size()<2){
    c.push_back(-1);
  }
  lf=in[x];rt=in[x];val=mk(c[0], c[1]);
  updt(1,0,cnt-1);
}
int main(){
  int tt;
  cin>>tt;
  while(tt--){
    int n, m,  x, y;
    cin>>n>>m;
    for(int i=0; i<=n; ++i){
      a[i].clear();
      v[i].clear();
    }
    for(int i=0; i<n-1; ++i){
      scanf("%d%d",&x,&y);
      a[x].push_back(y);
      a[y].push_back(x);
    }
    cnt=0;
    dfs1(n,-1);
    dfs(n,-1, mk(0,0));
    dfs2(n, -1);
    init(1,0,cnt-1);
    int ans=0, t, z;
    for(int i=0; i<m; ++i){
      scanf("%d%d",&t,&x);
      if(t==1){
        doo(x);
      }
      else{
        lf=rt=in[x];
        ans=qry(1,0,cnt-1);
        printf("%d\n",ans);
      }
    }
  }
  return 0;
}