// 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);
}
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);
  int q;cin>>q;
  while(q--){
    int t,v;cin>>t>>v;
    v--;
    if(t==1)col[v]^=1;
    else{
      deque<tuple<int,int,int>> deq;
      int ans=1e9;
      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";
    }
  }
}