// g++-14 1.cpp -std=c++20 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;

#include <atcoder/modint>
using namespace atcoder;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

random_device seed;
mt19937_64 randint(seed());

ll grr(ll mi, ll ma) { // [mi, ma)
    return mi + randint() % (ma - mi);
}

// https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=7595367#1
// https://atcoder.jp/contests/abc148/submissions/41641665

#include <vector>

struct lca{
  private:
  using vi = std::vector<int>;
  using vvi = std::vector<vi>;
  vvi g;
  vvi ancestor;
  vi depth;
  int root;

  void init(){
    ancestor.resize(g.size());
    depth.resize(g.size());
    dfs(root,-1,0);
  }

  void dfs(int now,int prev,int _depth){
    depth[now]=_depth;
    for(int i=prev,x=-1;i!=-1;){
      ancestor[now].emplace_back(i);
      i=++x < (int)ancestor[i].size() ? ancestor[i][x] : -1;
    }
    for(auto& next:g[now]){
      if(next==prev)continue;
      dfs(next,now,_depth+1);
    }
  }

  public:
  lca(vvi& _g,int _r=0) : g(_g),root(_r){ init(); }

  int deep(int v){
    return depth[v];
  }

  int parent(int v){
    return v == root ? -1 : ancestor[v][0];
  }

  int kth_ancestor(int v,int k){
    if(depth[v]<k)return -1;
    for(int i=k ? std::__lg(k) : -1;i>=0;--i){
      if((k>>i)&1)v=ancestor[v][i];
    }
    return v;
  }

  int query(int u,int v){
    if(depth[u]!=depth[v]){
      if(depth[u]>depth[v])std::swap(u,v);
      v=kth_ancestor(v,depth[v]-depth[u]);
    }
    if(u==v)return u;
    for(int i=std::__lg(depth[u]);i>=0;--i){
      if(depth[u]<(1<<i))continue;
      if(ancestor[u][i]!=ancestor[v][i])u=ancestor[u][i],v=ancestor[v][i];
    }
    return ancestor[u][0];
  }

  int distance(int u,int v){
    int q=query(u,v);
    return deep(u)+deep(v)-2*deep(q);
  }
};

int main(){
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n;cin>>n;
  vvi g(n);
  rep(i,0,n-1){
    int u,v;cin>>u>>v;
    u--;v--;
    g[u].emplace_back(v);
    g[v].emplace_back(u);
  }
  vi col(n,0);
  set<int> bl;
  lca l(g);
  int q;cin>>q;
  while(q--){
    int t,v;cin>>t>>v;
    v--;
    if(t==1){
      col[v]^=1;
      if(col[v])bl.insert(v);
      else bl.erase(v);
    }
    else{
      deque<tuple<int,int,int>> deq;
      int ans=1e9;
      if(col[v]){
        cout<<0<<"\n";
        continue;
      }
      if(bl.size()<=300){
        for(int pos:bl){
          ans=min(ans,l.distance(v,pos));
        }
        cout<<ans<<"\n";
        continue;
      }
      deq.push_back({0,v,-1});
      while(!deq.empty()){
        auto [dist,idx,par]=deq.front();
        deq.pop_front();
        if(col[idx]==1){
          if(dist<ans)ans=dist;
          break;
        }
        for(int nxt:g[idx]){
          if(nxt==par)continue;
          if(col[nxt]==1){
            if(dist+1<ans)ans=dist+1;
          }
          else{
            deq.push_back({dist+1,nxt,idx});
          }
        }
      }
      cout<<ans<<"\n";
    }
  }
}