#include <bits/stdc++.h>
using namespace std; 
typedef long long i64; 
const int N = 1e5 + 5; 

int n, q, f[17][N], sz[N], son[N];
int top[N], dfn[N], dep[N], num, idx[N];  
vector<int> G[N]; 

void dfs1(int x, int fa) {
    dep[x] = dep[f[0][x] = fa] + 1; sz[x] = 1; 
    for (int i = 1; i <= 16; ++i) f[i][x] = f[i - 1][f[i - 1][x]]; 
    for (int y : G[x]) if (y != fa) {
        dfs1(y, x); sz[x] += sz[y]; 
        if (sz[y] > sz[son[x]]) son[x] = y; 
    }
}
void dfs2(int x, int tp) {
    top[x] = tp; idx[dfn[x] = ++num] = x; 
    if (!son[x]) return; dfs2(son[x], tp); 
    for (int y : G[x]) if (y != son[x] && y != f[0][x]) dfs2(y, y); 
}

i64 T[N * 4], tag[N * 4]; 
inline void pushup(int o) { T[o] = T[o << 1] + T[o << 1 | 1]; }
inline void maketag(int o, int l, int r, int k) { T[o] += 1ll * (r - l + 1) * k; tag[o] += k; }
inline void pushdown(int o, int l, int r) {
    if (!tag[o]) return; int mid = l + r >> 1; 
    maketag(o << 1, l, mid, tag[o]); maketag(o << 1 | 1, mid + 1, r, tag[o]); 
    tag[o] = 0; 
}
void update(int o, int l, int r, int x, int y) {
    if (x <= l && r <= y) return maketag(o, l, r, 1), void(); 
    pushdown(o, l, r); int mid = l + r >> 1; 
    if (x <= mid) update(o << 1, l, mid, x, y); 
    if (mid < y) update(o << 1 | 1, mid + 1, r, x, y); 
    pushup(o); 
}
i64 query(int o, int l, int r, int x, int y) {
    if (x <= l && r <= y) return T[o]; 
    pushdown(o, l, r); int mid = l + r >> 1; i64 res = 0; 
    if (x <= mid) res += query(o << 1, l, mid, x, y); 
    if (mid < y) res += query(o << 1 | 1, mid + 1, r, x, y); 
    return res; 
}
int search(int o, int l, int r, i64 s) {
    if (l == r) return idx[l]; 
    pushdown(o, l, r); int mid = l + r >> 1; 
    if (s <= T[o << 1]) return search(o << 1, l, mid, s); 
    return search(o << 1 | 1, mid + 1, r, s - T[o << 1]); 
}

int main(void) {
    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n; 
    for (int i = 1; i < n; ++i) {
        int x, y; cin >> x >> y; 
        G[x].emplace_back(y); G[y].emplace_back(x); 
    }
    dfs1(1, 0); dfs2(1, 1); 
    cin >> q; 
    while (q--) {
        int op, x, y; cin >> op >> x; 
        if (op == 1) update(1, 1, n, dfn[x], dfn[x] + sz[x] - 1); 
        else {
            cin >> y; 
            while (top[x] != top[y]) {
                if (dep[top[x]] < dep[top[y]]) swap(x, y); 
                update(1, 1, n, dfn[top[x]], dfn[x]); 
                x = f[0][top[x]]; 
            }
            if (dep[x] < dep[y]) swap(x, y); 
            update(1, 1, n, dfn[y], dfn[x]); 
        }
        i64 sum = T[1] / 2 + 1; 
        x = search(1, 1, n, sum); 
        if (query(1, 1, n, dfn[x], dfn[x] + sz[x] - 1) >= sum) cout << x << '\n'; 
        else {
            for (int i = 16; i >= 0; --i) if (f[i][x]) {
                y = f[i][x]; 
                if (query(1, 1, n, dfn[y], dfn[y] + sz[y] - 1) < sum) x = y; 
            }
            cout << f[0][x] << '\n'; 
        }
    }
    return 0; 
}