#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5, INF = 1e9;
int vis[maxn], n, SZ, rt, F[maxn], sz[maxn], head[maxn], tot, dis[maxn], visn[maxn], vism[maxn], m, K, QQ;
vector<int> vec[maxn], imp;
vector<pair<int, int>> tag[maxn];
queue<int> Q;
struct edge {
	int v, pre;
}e[maxn << 1];
void add(int u, int v) {
	e[++ tot].v = v;
	e[tot].pre = head[u];
	head[u] = tot;
}
void make_tree(int now) {
	vis[now] = 1;
	for(int i = head[now];i;i = e[i].pre) {
		int v = e[i].v;
		if(vis[v]) continue;
		vec[now].push_back(v), vec[v].push_back(now);
		make_tree(v);
	}
}
void getSZ(int now, int f) {
	SZ ++;
	F[now] = sz[now] = 0;
	for(int v : vec[now]) {
		if(v == f || vis[v]) continue;
		getSZ(v, now);
	}
}
void getrt(int now, int f) {
	sz[now] = 1;
	for(int v : vec[now]) {
		if(vis[v] || v == f) continue;
		getrt(v, now);
		sz[now] += sz[v];
		F[now] = max(F[now], sz[v]);
	}
	
	F[now] = max(F[now], SZ - F[now]);
	if(!rt || F[now] < F[rt]) rt = now;
}
void check(int now, int f, int id) {
	visn[now] = id;
	for(int v : vec[now]) {
		if(v == f || vis[v]) continue;
		check(v, now, id);
	}
}
void getim(int now, int f) {
	for(int i = head[now];i;i = e[i].pre) {
		int v = e[i].v;
		if(v == f || vis[v]) continue;
		if(visn[v] > visn[now]) imp.push_back(now);  
	}
	for(int v : vec[now]) {
		if(v == f || vis[v]) continue;
		getim(v, now);
	}
}
void getdis(int now) {
//	cout << now << " !!!!\n";
	Q.push(now);
	vism[now] = 1;
	tag[now].push_back(make_pair(now, 0));
	while(!Q.empty()) {
		int t = Q.front();
		Q.pop();
		for(int i = head[now];i;i = e[i].pre) {
			int v = e[i].v;
			if(vism[v]) continue;
			vism[v] = vism[now] + 1;
			tag[v].push_back(make_pair(now, vism[v] - 1));
			Q.push(v);
		}
	}
}
void cleartag(int now, int f) {
	vism[now] = 0;
	for(int v : vec[now]) {
		if(v == f || vis[v]) continue;
		cleartag(v, now);
	}
}
void dfs(int now, int f) {
	SZ = rt = 0;
	getSZ(now, f);
	getrt(now, f);
	vis[rt] = 1;
//	cout << rt << " " << F[rt] << " !!!" << '\n';
	for(int v : vec[rt]) {
		if(vis[v]) continue;
		check(v, rt, v);
	}
	imp.clear();
	for(int v : vec[rt]) {
		if(vis[v]) continue;
		getim(v, rt);
	}
	for(int x : imp) getdis(x), cleartag(rt, rt);
	getdis(rt), cleartag(rt, rt);
	for(int v : vec[rt]) {
		if(vis[v]) continue;
		dfs(v, now);
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n >> m >> K;
	for(int i = 1, u, v;i <= m;i++) {
		cin >> u >> v;
		add(u, v), add(v, u);
	}
	make_tree(1);
	for(int i = 1;i <= n;i++) vis[i] = 0, dis[i] = INF;
	dfs(1, 0);
	cin >> QQ;
	for(int i = 1, op, x;i <= QQ;i++) {
		cin >> op >> x;
		if(op == 1) {
			for(pair<int, int> t : tag[x]) dis[t.first] = min(dis[t.first], t.second);
		}
		else {
			int ans = INF;
			for(pair<int, int> t : tag[x]) ans = min(ans, t.second + dis[t.first]);
			cout << ans << '\n';
		}
	}
}