#include <iostream>
#include <cstdio>
#include <bitset>
#include <vector>
using namespace std;
const int N=1e5+10;
int n,m,a[N],b[N],p[N],q;
bitset<N>t[N],avoid;
vector<int>G[N];
void work(){
    scanf("%d %d %d",&n,&m,&q);
    for(int i=1,u,v;i<=m;i++){
        scanf("%d %d",&u,&v);
        G[u].push_back(v);
    }
    for(int i=n;i>=1;i--){
        t[i][i]=1;
        for(auto j:G[i]){
            t[i]|=t[j];
        }
    }
    for(int i=1;i<=n;i++)scanf("%d",a+i),p[a[i]]=i;
    for(int i=1;i<=n;i++)scanf("%d",b+i);
    int o,x,y,l,r,ans;
    while(q--){
        scanf("%d %d",&o,&x);
        if(o==1){
            scanf("%d",&y);
            swap(p[a[x]],p[a[y]]);
            swap(a[x],a[y]);
        }else if(o==2){
            scanf("%d",&y);
            swap(b[x],b[y]);
        }else{
            scanf("%d %d",&l,&r);
            ans=0;
            for(int i=l;i<=r;i++){
                if(t[x][p[i]]){
                    ans=max(ans,b[p[i]]);
                    if(ans==n)break;
                }
            }
            printf("%d\n",ans);
        }
    }
    for(int i=1;i<=n;i++){
        G[i].clear();
        t[i]=avoid;
    }
    return;
}
int main(){
    freopen("recall.in","r",stdin);
    freopen("recall.out","w",stdout);
    int c,T;
    scanf("%d %d",&c,&T);
    while(T--)work();
}