#include<bits/stdc++.h>
//#define N2MENT
#ifdef N2MENT
	#define LOG(...) fprintf(stderr,__VA_ARGS__), void(0)
#else
	#define LOG(...) void(0)
#endif
using namespace std;
using ll = long long;
const int maxn = 1e5 + 10;
class SegTree {
public:
	ll tr[maxn], lazy[maxn];
	void __update(int k) {
		tr[k] = tr[k << 1] + tr[k << 1 | 1];
	} 
	void __push(int k, int l, int r) {
		if(!lazy[k]) return;
		int mid = (l + r) >> 1;
		tr[k << 1] += lazy[k] * (mid - l + 1);
		tr[k << 1 | 1] += lazy[k] * (r - mid);
		lazy[k << 1] += lazy[k];
		lazy[k << 1 | 1] += lazy[k];  
		lazy[k] = 0;
	}
	void modify(int k, int l, int r, int L, int R, ll val) {
		if(L <= l && r <= R) {
			tr[k] += val * (r - l + 1);
			lazy[k] += val;
			return;
		}
		__push(k, l, r);
		int mid = (l + r) >> 1;
		if(L <= mid) modify(k << 1, l, mid, L, R, val);
		if(R > mid) modify(k << 1 | 1, mid + 1, r, L, R, val);
		__update(k);
	} 
	int query(int k, int l, int r, int L, int R) {
		if(L <= l && r <= R) return tr[k];
		__push(k, l, r);
		int mid = (l + r) >> 1;
		ll res = 0;
		if(L <= mid) res += query(k << 1, l, mid, L, R);
		if(R > mid) res += query(k << 1 | 1, mid + 1, r, L, R);
		return res;
	}
	int find(int k, int l, int r, ll val) {
		if(tr[k] < val) return -1;
		if(l == r) return l;
		__push(k, l, r);
		int mid = (l + r) >> 1;
		int res = find(k << 1, l, mid, val);
		if(~res) return res;
		return find(k << 1 | 1, mid + 1, r, val - tr[k << 1]);
	}
}sgt;
vector<int> G[maxn];
int fa[maxn][20], siz[maxn], son[maxn], top[maxn], dep[maxn], id[maxn], rev[maxn], cnt;
int n;
void dfs1(int u, int f) {
	fa[u][0] = f;
	dep[u] = dep[f] + 1;
	siz[u] = 1;
	for(int i = 1; i < 20; i++) fa[u][i] = fa[fa[u][i - 1]][i - 1];
	for(int v : G[u]) {
		if(v == f) continue;
		dfs1(v, u);
		siz[u] += siz[v];
		if(!son[u] || siz[son[u]] < siz[v]) son[u] = v;
	} 
}
void dfs2(int u, int tp) {
	id[u] = ++cnt;
	rev[cnt] = u;
	top[u] = tp;
	if(son[u]) dfs2(son[u], tp);
	for(int v : G[u]) {
		if(v == fa[u][0] || v == son[u]) continue;
		dfs2(v, v);
	}
}
int Query() {
	int sum = sgt.query(1, 1, n, 1, n);
	int m = (sum >> 1) + 1;
	int u = rev[sgt.find(1, 1, n, m)];
	while(sgt.query(1, 1, n, id[top[u]], id[top[u]] + siz[top[u]] - 1) < m) u = fa[top[u]][0];
	if(sgt.query(1, 1, n, id[u], id[u] + siz[u] - 1) >= m) return u;
	for(int i = 19; ~i; i--) if(fa[u][i] && sgt.query(1, 1, n, id[fa[u][i]], id[fa[u][i]] + siz[fa[u][i]] - 1) < m) u = fa[u][i];
	return fa[u][0];
}
void ModifySubtree(int u) {
	sgt.modify(1, 1, n, id[u], id[u] + siz[u] - 1, 1);
}
void ModifyChain(int u, int v) {
	while(top[u] != top[v]) {
		if(dep[top[u]] < dep[top[v]]) swap(u, v);
		sgt.modify(1, 1, n, id[top[u]], id[u], 1);
		u = fa[top[u]][0];
	}
	if(dep[u] > dep[v]) swap(u, v);
	sgt.modify(1, 1, n, id[u], id[v], 1);
}
int main() {
#ifndef N2MENT
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
#endif
	cin >> n;
	for(int i = 1, u, v; i < n; i++) {
		cin >> u >> v;
		G[u].emplace_back(v);
		G[v].emplace_back(u);
	}
	dfs1(1, 0);
	dfs2(1, 1);
	int q;
	cin >> q;
	while(q--) {
		int op, u, v;
		cin >> op;
		if(op == 1) {
			cin >> u;
			ModifySubtree(u);
		} else {
			cin >> u >> v;
			ModifyChain(u, v);
		}
		for(int i = 1; i <= n; i++) LOG("%d ", sgt.query(1, 1, n, id[i], id[i]));
		LOG("\n");
		cout << Query() << '\n';
	}
	
}