//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 100005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "CCOLOR"

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n, q;
set<int> g[N];
int sz[N], par[N];
int d[N], f[N][22];
multiset<int> ans[N];
int color[N];

//==preprocess==\\

void DFS(int u, int p){
    for(int i=1; i<20; i++){
        f[u][i] = f[f[u][i-1]][i-1];
    }
    for(auto v : g[u]){
        if (v==p) continue;
        d[v] = d[u]+1;
        f[v][0] = u;
        DFS(v,u);
    }
}

//==LCA==\\

int lca(int u, int v) {
    if (d[u] < d[v]) swap(u, v);
    int delta = d[u] - d[v];

    for (int i = 19; i >= 0; i--)
        if ((delta >> i) & 1) u = f[u][i];

    if (u == v) return u;

    for (int i = 19; i >= 0; i--)
        if (f[u][i] != f[v][i])
            u = f[u][i], v = f[v][i];

    return f[u][0];
}


//==Distances==\\

int dis(int u, int v){
    return d[u] + d[v] - 2*d[lca(u,v)];
}


//read file

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        freopen(Task".out","w",stdout);
    }
    cin >> n;
    for(int i=1; i<n; i++){
        int u, v; cin >> u >> v;
        g[u].insert(v);
        g[v].insert(u);
    }
}

void preprocess(){
    DFS(1,-1);
}

//building centroid tree

int dfs(int u, int p) {
  sz[u] = 1;
  for(auto v : g[u]) if(v != p) {
    sz[u] += dfs(v, u);
  }
  return sz[u];
}
int centroid(int u, int p, int n) {
  for(auto v : g[u]) if(v != p) {
    if(sz[v] > n / 2) return centroid(v, u, n);
  }
  return u;
}
void build(int u, int p) {
    int m = dfs(u, p);
    int c = centroid(u, p, m);
    if(p == 0) p = c;
    par[c] = p;

    vector<int> tmp(g[c].begin(), g[c].end());
    for(auto v : tmp) {
        g[c].erase(v); g[v].erase(c);
        build(v, c);
    }
}

//update query

void update(int u){
    int x = u;
    while(1){
        int tmp = dis(u,x);
        if (color[u]) ans[x].erase(ans[x].find(tmp));
        else ans[x].insert(tmp);
        if (par[x]==x) break;
        x = par[x];
    }
    color[u] = 1-color[u];
}

//find query

int get(int u){
    int x = u;
    int tmp = inf;
    while (1){
        if (*ans[x].begin()!=inf) tmp = min(tmp, dis(u,x) + *ans[x].begin());
        if (par[x]==x) break;
        x = par[x];
    }
    return (tmp==inf ? -1 : tmp);
}

void proc()
{
    preprocess();
    build(1,0);
    for(int i=1; i<=n; i++) ans[i].insert(inf);
    cin >> q;
    for(int i=1; i<=q; i++){
        int ty, u;
        cin >> ty >> u;
        if (ty==1) update(u);
        else cout << get(u) << '\n';
    }
}

signed main()
{
    readfile();
    proc();
    return 0;
}