#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
queue<ll> Q;
vector<ll> vec1[100010],vec2[100010],vec,id;
vector<ll> dis[100010][19],f[100010];
ll n,m,k,q,head[100010],cnt=0;
ll rt,minn=inf,nsiz,siz[100010];
ll Fa[100010],blg[100010],dep[100010];
bl ck[100010],pd[100010];
struct node{
	ll nxt,to;
}e[400040];
void add(ll u,ll v){
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	head[u]=cnt;
}
void dfs(ll fa,ll u){
	ck[u]=1;
	go(u){
		ll v=e[i].to;
		if(v==fa) continue;
		if(!ck[v]){
			vec1[u].push_back(v);
			vec1[v].push_back(u);
			dfs(u,v);
		}
		else if(u<v) vec2[u].push_back(v);
	}
}
void getroot(ll fa,ll u){
	siz[u]=1;
	ll maxx=0;
	fr(i,0,(ll)vec1[u].size()-1){
		ll v=vec1[u][i];
		if(v==fa||ck[v]) continue;
		getroot(u,v);
		maxx=max(maxx,v);
		siz[u]+=siz[v];
	}
	maxx=max(maxx,nsiz-siz[u]);
	if(maxx<minn){
		minn=maxx;
		rt=u;
	}
}
void dfs1(ll RT,ll fa,ll u){
	blg[u]=RT;
	siz[u]=1;
	fr(i,0,(ll)vec1[u].size()-1){
		ll v=vec1[u][i];
		if(v==fa||ck[v]) continue;
		dfs1(RT,u,v);
		siz[u]+=siz[v];
	}
}
void dfs2(ll fa,ll u){
	pd[u]=1;
	id.push_back(u);
	fr(i,0,(ll)vec2[u].size()-1){
		ll v=vec2[u][i];
		if(blg[v]!=blg[u]) vec.push_back(u);
	}
	fr(i,0,(ll)vec1[u].size()-1){
		ll v=vec1[u][i];
		if(v==fa||ck[v]) continue;
		dfs2(u,v);
	}
}
il void bfs(ll d,ll x){
	fr(i,0,(ll)id.size()-1) dis[id[i]][d][x]=inf;
	dis[vec[x]][d][x]=0;
	Q.push(vec[x]);
	while(!Q.empty()){
		ll u=Q.front();
		Q.pop();
		go(u){
			ll v=e[i].to;
			if(!pd[v]||dis[v][d][x]!=inf) continue;
			dis[v][d][x]=dis[u][d][x]+1;
			Q.push(v);
		}
	}
}
void solve(ll fa,ll u){
	dep[u]=dep[fa]+1;
	Fa[u]=fa;
	ck[u]=1;
	blg[u]=u;
	siz[u]=1;
	fr(i,0,(ll)vec1[u].size()-1){
		ll v=vec1[u][i];
		if(v==fa||ck[v]) continue;
		dfs1(v,u,v);
		siz[u]+=siz[v];
	}
	vec.clear();
	vec.push_back(u);
	pd[u]=1;
	id.clear();
	id.push_back(u);
	fr(i,0,(ll)vec1[u].size()-1){
		ll v=vec1[u][i];
		if(v==fa||ck[v]) continue;
		dfs2(u,v);
	}
	sort(vec.begin(),vec.end());
	vec.erase(unique(vec.begin(),vec.end()),vec.end());
	f[u].resize((ll)vec.size());
	fr(i,0,(ll)f[u].size()-1) f[u][i]=inf;
	fr(i,0,(ll)id.size()-1) dis[id[i]][dep[u]].resize((ll)vec.size());
	fr(i,0,(ll)vec.size()-1) bfs(dep[u],i);
	fr(i,0,(ll)id.size()-1) pd[id[i]]=0;
	go(u){
		ll v=e[i].to;
		if(v==fa||ck[v]) continue;
		nsiz=siz[u];
		minn=inf;
		getroot(u,v);
		solve(u,rt);
	}
}
il void mdf(ll x){
	for(ll u=x;u;u=Fa[u]) fr(i,0,(ll)f[u].size()-1) f[u][i]=min(f[u][i],dis[x][dep[u]][i]);
}
il ll query(ll x){
	ll res=inf;
	for(ll u=x;u;u=Fa[u]) fr(i,0,(ll)f[u].size()-1) res=min(res,dis[x][dep[u]][i]+f[u][i]);
	return res;
}
int main(){
	n=read();
	m=read();
	k=read();
	fr(i,1,m){
		ll u=read(),v=read();
		add(u,v);
		add(v,u);
	}
	dfs(0,1);
	fr(i,1,n) ck[i]=0;
	getroot(0,1);
	solve(0,rt);
	q=read();
	while(q--){
		ll opt=read(),x=read();
		if(opt==1) mdf(x);
		else writeln(query(x));
	}
}