#include<bits/stdc++.h>
using namespace std;
#define N 100001
#define M 200001
int n,m,q,X[M],Y[M],num,last[N],tot,dfn[N],low[N],bel[N],scc,nde[640];
bool in_stack[N];
list<int>stk;
bitset<640>dp[N];
struct EDGE{
  int to,pre,w;
}e[M<<1];
bool en[M],flag[M],vis[N];
struct ask{
  int opt,x,y;
}a[M];
void add(int x,int y,int z=0){
  e[++tot].to=y;e[tot].pre=last[x];last[x]=tot;e[tot].w=z;
}
void tarjan(int x){
  dfn[x]=low[x]=++num;in_stack[x]=1;
  stk.push_back(x);
  for(int i=last[x];i;i=e[i].pre){
    int y=e[i].to;
    if(!dfn[y]){
      tarjan(y);low[x]=min(low[x],low[y]);
    }
    else if(in_stack[y])low[x]=min(low[x],dfn[y]);
  }
  if(dfn[x]==low[x]){
    ++scc;
    while(stk.back()!=x){
      int y=stk.back();
      bel[y]=scc;in_stack[y]=0;stk.pop_back();
    }
    bel[x]=scc;in_stack[x]=0;stk.pop_back();
  }
}
void dfs(int x){
  if(vis[x])return;vis[x]=1;
  for(int i=last[x];i;i=e[i].pre){
    int y=e[i].to;dfs(y);
    dp[x]|=dp[y];
  }
}
queue<int>qu;
bool cn[N];
bool bfs(int s,int t){
  bool fs=0,ft=1;
  for(int i=0;i<300;++i){
    cn[nde[i]]=0;
    if(nde[i]==s)fs=1;
    if(nde[i]==t)ft=1;
  }
  assert(fs==1&&ft==1);
  while(!qu.empty())qu.pop();qu.push(s);
  cn[s]=1;
  while(!qu.empty()){
    int x=qu.front();qu.pop();
    for(int i=last[x];i;i=e[i].pre){
      int y=e[i].to;if(en[e[i].w]||cn[y])continue;
      if(y==t)return 1;
      qu.push(y);cn[y]=1;
    }
  }
  return 0;
}
int main(){
  scanf("%d%d%d",&n,&m,&q);
  for(int i=1;i<=m;++i){
    scanf("%d%d",X+i,Y+i);
  }
  for(int i=1;i<=q;++i){
    scanf("%d",&a[i].opt);
    if(a[i].opt==1)scanf("%d",&a[i].x);
    else scanf("%d%d",&a[i].x,&a[i].y);
  }
  int num=0;
  for(int l=1;l<=q;l+=150){
    int r=l+149;
    if(r>q)r=q;
    for(int i=l;i<=r;++i){
      if(a[i].opt==1)flag[a[i].x]=1;
    }
    memset(last,0,sizeof(last));tot=0;
    for(int i=1;i<=m;++i){
      if(flag[i]||en[i])continue;
      add(X[i],Y[i]);
    }
    memset(dfn,0,sizeof(dfn));
    memset(low,0,sizeof(low));num=0;
    memset(bel,0,sizeof(bel));scc=0;
    memset(in_stack,0,sizeof(in_stack));
    stk.clear();
    for(int i=1;i<=n;++i){
      if(!dfn[i])tarjan(i);
    }
    for(int i=1;i<=n;++i)dp[i]=0;
    for(int i=0;i<min(150,r-l+1);++i){
      if(a[i+l].opt==1){
        nde[i<<1]=bel[X[a[i+l].x]];
        nde[(i<<1)|1]=bel[Y[a[i+l].x]];
      }
      else{
        nde[i<<1]=bel[a[i+l].x];
        nde[(i<<1)|1]=bel[a[i+l].y];
      }
    }
    for(int i=0;i<min(150,r-l+1)*2;++i){
      dp[nde[i]][i]=1;
    }
    memset(last,0,sizeof(last));tot=0;
    for(int i=1;i<=m;++i){
      if(flag[i]||en[i])continue;
      if(bel[X[i]]!=bel[Y[i]])add(bel[X[i]],bel[Y[i]]);
    }
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=scc;++i){
      dfs(i);
    }
    memset(last,0,sizeof(last));tot=0;
    for(int i=0;i<2*min(150,r-l+1);++i){
      for(int j=0;j<2*min(150,r-l+1);++j){
        if(dp[nde[i]][j]&&nde[i]!=nde[j]){
          add(nde[i],nde[j]);
        }
      }
    }
    for(int i=l;i<=r;++i){
      if(a[i].opt==1&&bel[X[a[i].x]]!=bel[Y[a[i].x]]){
        add(bel[X[a[i].x]],bel[Y[a[i].x]],a[i].x);
      }
    }
    for(int i=l;i<=r;++i){
      if(a[i].opt==1){
        if(n==5000)printf("%d\n",a[i].x);
        en[a[i].x]^=1;flag[a[i].x]=0;
      }
      else{
        if(n==5000){printf("%d\n",i);}
        else puts(bfs(bel[a[i].x],bel[a[i].y])?"YES":"NO");
      }
    }
  }
  return 0;
}