#include <bits/stdc++.h>
using namespace std;
vector<int>g[100005];
int vis[2005][2005];
int a[100005],b[100005];
int n,m,q;
void dfs(int x,int fa)
{
    if(vis[fa][x])return;
    vis[fa][x]=1;
    for(int y:g[x])
    {
        dfs(y,fa);
    }
}
int main()
{
    freopen("recall.in","r",stdin);
    freopen("recall.out","w",stdout);
    int c,t;
    cin>>c>>t;
    while(t--)
    {
        cin>>n>>m>>q;
        for(int i=1;i<=m;i++)
        {
            int x,y;
            cin>>x>>y;
            g[x].push_back(y);
        }
       for(int i=1;i<=n;i++)
            dfs(i,i);
        for(int i=1;i<=n;i++)
            cin>>a[i];
        for(int i=1;i<=n;i++)
            cin>>b[i];
        while(q--)
        {
            int op,x,y,l,r;
            cin>>op;
            if(op==1)
            {
                cin>>x>>y;
                swap(a[x],a[y]);
            }else if(op==2)
            {
                cin>>x>>y;
                swap(b[x],b[y]);
            }
            else{
                cin>>x>>l>>r;
                int ans=0;
                for(int i=1;i<=n;i++)
                    if(vis[x][i]&&l<=a[i]&&a[i]<=r)
                        ans=max(ans,b[i]);
                cout<<ans<<"\n";
            }
        }
        for(int i=1;i<=n;i++)
            g[i].clear();
    }
}