#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7+7;
const int B = 1000;
bitset<2*B+3> F[N/2],E[B*2+2],cur;
int n,m,q,deg[N],ord[N],dft=0;
vector<int> G[N];
void add(int x,int y)
{
	G[x].push_back(y);
}
int u[N],v[N];
int qc[N],qu[N],qv[N],col[N];
bool key[N],cut[N];
int spec[N],id[N],idx=0;
int scc[N],low[N],dfn[N],num=0,cnt=0;
bool ins[N];
stack<int> st;
void tarjan(int x)
{
	dfn[x]=low[x]=++num;
	ins[x]=1;
	st.push(x);
	for(int y:G[x])
	{
		if(!dfn[y])
		{
			tarjan(y);
			low[x]=min(low[x],low[y]);
		}
		else if(ins[y])low[x]=min(low[x],dfn[y]);
	}
	if(dfn[x]==low[x])
	{
		int c=++cnt;
		int y=0;
		do
		{
			y=st.top();
			scc[y]=c;
			st.pop();
			ins[y]=0;
		}while(y!=x);
	}
}
queue<int> Q;
vector<int> S[N];
void init()
{
	for(int i=1;i<=cnt;i++)S[i].clear();
	for(int i=1;i<=n;i++)dfn[i]=low[i]=scc[i]=id[i]=0,ins[i]=key[i]=0,G[i].clear();
	for(int i=1;i<=idx;i++)spec[i]=0,F[i].reset();
	for(int i=1;i<=m;i++)cut[i]=0;
	dft=idx=cnt=num=0;
}
void qsolve(int l,int r)
{
	for(int i=l;i<=r;i++)
	if(qc[i]==1)key[u[qu[i]]]=key[v[qu[i]]]=1,cut[qu[i]]=1;
	else key[qu[i]]=key[qv[i]]=1;
	for(int i=1;i<=m;i++)if(!cut[i]&&col[i])add(u[i],v[i]);
	for(int i=1;i<=n;i++)if(!dfn[i])tarjan(i);
	for(int i=1;i<=m;i++)if(!cut[i]&&col[i]&&scc[u[i]]!=scc[v[i]])S[scc[u[i]]].push_back(scc[v[i]]),deg[scc[v[i]]]++;
	for(int i=1;i<=cnt;i++)if(!deg[i])Q.push(i);
	while(!Q.empty())
	{
		int x=Q.front();
		Q.pop();
		ord[++dft]=x;
		for(int y:S[x])
		{
			--deg[y];
			if(!deg[y])Q.push(y);
		}
	}
	for(int i=1;i<=n;i++)if(key[i])spec[id[i]=++idx]=i,F[scc[i]][idx]=1;
	for(int i=dft;i>=1;i--){int x=ord[i];for(int y:S[x])F[x]|=F[y];}
	for(int j=l;j<=r;j++)
	if(qc[j]==1) col[qu[j]]^=1;
	else 
	{
		for(int i=1;i<=idx;i++)E[i]=F[scc[spec[i]]];
		for(int i=l;i<=r;i++)if(qc[i]==1&&col[qu[i]])E[id[u[qu[i]]]][id[v[qu[i]]]]=1;
		cur.set();
		cur.reset(id[qu[j]]);
		Q.push(id[qu[j]]);
		while(!Q.empty())
		{
			int x=Q.front();
			Q.pop();
			for(int y;(y=(cur&E[x])._Find_first())<=idx;cur.reset(y))
		 	Q.push(y);
		}
		if(cur[id[qv[j]]])printf("NO\n");
		else printf("YES\n");
	}
	init();
}
int main()
{
	cin>>n>>m>>q;
	for(int i=1;i<=m;i++)scanf("%d %d",&u[i],&v[i]),col[i]=1;
	for(int i=1;i<=q;i++)
	{
		scanf("%d %d",&qc[i],&qu[i]);
		if(qc[i]==2)scanf("%d",&qv[i]);
	}
	for(int i=1;i<=q;i+=B)qsolve(i,min(i+B-1,q));
	return 0;
}