#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

#define mod 1000000007


/// Debugging shits start here...

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
/// Debugging shits ends here...
// templates
/*#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
/*template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;*/

/// Some frequent usable functions
void add(int &a,int b){a+=b;if(a>mod)a-=mod;}
void sub(int &a,int b){a-=b;if(a<0)a+=mod;}
void mul(int &a, int b) {a=1ll * a * b % mod;}
int exp(int a,int b)
{int res = 1;while(b){if(b&1){res = (res * a)%mod;}b= b/2;a = (a*a)%mod;}return res;}

int gcd(int a, int b, int &x, int &y) {if (a == 0) {x = 0; y = 1;return b;
}int x1, y1;int d = gcd(b%a, a, x1, y1); x = y1 - (b / a) * x1;y = x1;return d;}
//int find(int v){return v==parent[v]?v:parent[v] = find(parent[v]);}
// void merge(int i,int j)
// {i = find(i);j = find(j);if(i == j)return;parent[parent[i]] = parent[j];cmp--;}

// Directions.......
/* int dx[] = {1,-1,0,0} , dy[] = {0,0,1,-1}; */ // 4 Direction
/* int dx[] = {1,-1,0,0,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1,1,-1}; */ // 8 Direction
/* int dx[] = {1,-1,1,-1,2,2,-2,-2} , dy[] = {2,2,-2,-2,1,-1,1,-1}; */ // Knight moves
/* int dx[] = {2,-2,1,1,-1,-1} , dy[] = {0,0,1,-1,1,-1}; */ // Hexagonal Direction
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define sp(a , x) cout << fixed << setprecision(a) << x << endl;
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define mset(a, b) memset(a, b, sizeof a)
#define int                        long long
#define sz(x) ((ll)(x.size()))
#define sqr(x) ((x) * (x))
#define graph vector<int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define pi pair<int,int>
#define all(c)                      c.begin() , c.end()
#define rep(i,a)                    for(int i=0;i<a;i++)
#define rep1(i,a)                   for(int i=1;i<=a;i++)
#define iter(it,a) for(auto it=a.begin();it!=a.end();it++)
#define PQP priority_queue<pi, vector<pi>, greater<pi>>
#define PQI priority_queue<int, vector<int>, greater<int>>
#define dbg debug
#define inf (int)1e16
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));


/// define some data.......

const int N = (int)1e5+5;
const int LOGN = 20;
const int M=LOGN;

int ancestor[N][25],depth[N],size[N],length[N],parent[N];
int ans[N];
set<int>g[N];
int timer;

void dfs(int v,int p)
{
    ancestor[v][0]=p;

    for(int i=1;i<=LOGN;i++)
    {
      ancestor[v][i] = ancestor[ancestor[v][i-1]][i-1];
    }

    for(int u:g[v])
    {
       if(u==p)continue;
       length[u] =length[v]+1;
       depth[u] = depth[v]+1;
       dfs(u,v);
    }

}

int lca(int u,int v)
{
  if(depth[u] < depth[v])swap(u,v);

    for(int i=LOGN;i>=0;i--)
    {
      if(depth[ancestor[u][i]]>=depth[v])
      {
        u = ancestor[u][i];
      }
    }
  if(u == v)return u;

    for(int i=LOGN;i>=0;i--)
    {
      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)
{
  return (length[u]+length[v] - 2*length[(lca(u,v))]);
}
/// deomposition
int node;
void cnt(int v,int p)
{
    size[v]=1;
    node++;
  for(auto u:g[v])
  {
      if(u==p)continue;
      cnt(u,v);
      size[v]+=size[u];
  }
}

int dfs1(int v,int p)
{
    for(int x:g[v])
    if(x!=p && size[x]>(node/2))
        return dfs1(x,v);
    return v;
}

void decomposition(int v,int p)
{
         node=0;
         cnt(v,v);
        int cet=dfs1(v,v);
        parent[cet]=(p==-1)?cet:p;
        for(int x:g[cet])
           {g[x].erase(cet);
           decomposition(x,cet);
           }
        g[cet].clear();
}
 // Query
 set<pair<int,int>>dist[N];
 int col[N];

void update(int v)
{
    int cur=v;
    col[v] = 1-col[v];
    while(1)
    {
        int d = distance(cur,v);
        if(col[v]==0)dist[cur].erase({d,v});
        else dist[cur].insert({d,v});
        if(cur==parent[cur])break;
        cur=parent[cur];
    }

}

int query(int v)
{
    int res=inf,cur=v;
    while(1)
    {
        int d = distance(cur,v);
        int b = (*dist[cur].begin()).F;
        //dbg(b,d);
        res = min( res , d );
        if( cur == parent[cur])break;
        cur=parent[cur];
        //dbg(res);
    }
    if(res>=inf)res =-1;
    return res;
}


void solve()
{
  int n,q;
  cin >> n;
  rep(i,n-1)
  {
    int x,y;
    cin >> x >> y;
    g[x].insert(y);
    g[y].insert(x);
  }
  length[1]=1;
  depth[1]=1;
  dfs(1,1);
  decomposition(1,-1);
  //update(1);
  cin >> q;
  int m=q;
  while (m--)
  {
    int tp;
    cin >> tp;
    if(tp==0)
    {
        int v;cin >> v;
        update(v);
    }
    else
    {
      int x;
      cin >> x;
     cout<<query(x)<<"\n";
    }
  }
}

int32_t main(){
    fast;
  int test=1;
   //cin >> test;
   int t=1;
   while(test--)
   {
     solve();
   }

}