#include<bits/stdc++.h>
using namespace std;
// #define int long long
//#define mod 1000000007
#define N 200005
#define pii pair<int,int>
#define fi first
#define se second
//#define rep(i,j,k) for(int i=j;i<=k;i++)
int n,m,k,q;
vector<int>mp[N],T[N],at[N];
vector<int>que[N];
int vis[N];
void getT(int x,int fa=0){
	vis[x]=1;
	for(int v:mp[x]){
		if(v==fa)continue;
		if(vis[v]){at[x].push_back(v);continue;}
		T[v].push_back(x),T[x].push_back(v);getT(v,x);
	}
}
int d[23][N];
bool tg[N];
int imp[N][23],bc[N];
int bxhd[N][23];
int ans[N];
int sz[N];
int col[N];
int tot;
int rt;
int lst[N],kk;
int qop[N],qv[N];
void gtsz(int x,int fa){
	sz[x]=1;
	lst[++kk]=x;
	for(int v:T[x]){
		if(v==fa||vis[v])continue;
		gtsz(v,x);
		sz[x]+=sz[v];
	}
}
int gtrt(int x){
	kk=0;
	gtsz(x,x);
	int ret=0;
	function<void(int,int)>find=[&](int u,int fa){
		if(sz[x]/2>=sz[u]-1&&sz[x]-sz[u]>=sz[x]/2){ret=u;return;}
		for(int v:T[u]){if(fa==v||vis[v])continue;find(v,u);if(ret)return;}
	};
	find(x,x);
	// assert(ret);
	return ret;
}
void gtd(int s,int *d,int pre){
	queue<int>q;
	q.push(s);
	for(int i=1;i<=kk;i++)d[lst[i]]=-1;
	d[s]=0;
	while(q.size()){
		int u=q.front();q.pop();
		for(int v:mp[u]){
			// cout<<v<<endl;
			if(col[v]<=pre||d[v]!=-1)continue;
			d[v]=d[u]+1;
			q.push(v);
		}
	}
}
void stcol(int x,int fa,int op){
	// cout<<x<<endl;
	col[x]=op;
	for(int v:T[x]){
		if(v==fa||vis[v])continue;
		stcol(v,x,op);
	}
}
int qwq[N];
void sol(int x){
	// cout<<x<<endl;
	vis[x]=1;
	int pre=tot;
	col[x]=pre+1;
	for(int v:T[x]){if(vis[v])continue;stcol(v,v,++tot);}
	imp[x][++bc[x]]=x;
	gtd(x,d[1],pre);
	for(int i=1;i<=kk;i++){
		int v=lst[i];
		if(v==x||col[v]<=pre)continue;
		for(int u:at[v]){
			if(col[u]<=pre||col[u]==col[v])continue;
			imp[x][++bc[x]]=v;
			gtd(v,d[bc[x]],pre);
		}
	}
	// if(bc[x]>12)cerr<<x<<' '<<bc[x]<<endl;
	// assert(bc[x]<=20);
	// for(int i=1,v=lst[1];i<=kk;v=lst[++i])cout<<d[1][v]<<' ';cout<<endl;
	int ct=0;
	for(int i=1,v=lst[1];i<=kk;v=lst[++i])
		for(auto q:que[v])qwq[++ct]=q;
	sort(qwq+1,qwq+ct+1);
	int l=0;
	for(int i=1,w=qwq[1];i<=ct;w=qwq[++i]){
		int op=qop[w],v=qv[w];
		if(op==1){
			for(int i=1;i<=bc[x];i++){
				bxhd[x][i]=min(bxhd[x][i],d[i][v]);
			}
			l=1;
		}else if(l){
			for(int i=1;i<=bc[x];i++){
				ans[w]=min(ans[w],bxhd[x][i]+d[i][v]);
				// cout<<ans[op]<<endl;
			}
		}
	}
	int g=0;
	for(int v:T[x]){
		if(vis[v])continue;
		g++;
		int rt=gtrt(v);
		sol(rt);
	}
}
signed main(){
	// freopen("test.in","r",stdin);
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>m>>k;
	for(int i=1;i<=m;i++){
		int u,v;
		cin>>u>>v;
		mp[u].push_back(v),mp[v].push_back(u);
	}
	getT(1);
	memset(vis,0,sizeof(vis));
	memset(bxhd,0x3f,sizeof(bxhd));
	memset(ans,0x3f,sizeof(ans));
	cin>>q;
	for(int i=1;i<=q;i++){
		cin>>qop[i]>>qv[i];
		if(qop[i]==1&&tg[qv[i]])continue;
		if(qop[i]==1)tg[qv[i]]=1;
		if(qop[i]==1)que[qv[i]].push_back(i);
		else que[qv[i]].push_back(i);
	}
	rt=gtrt(1);
	sol(rt);
	for(int i=1;i<=q;i++){
		if(ans[i]>1e9)continue;
		cout<<ans[i]<<'\n';
	}
	return 0;
}