#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2e3+5, B=0;
int T, n, q, m, a[N], b[N], rt[N], xxx, vis[N], ans;
ll si[N];
vector <int> g[N];
void dfs(int x, int l, int r){
    vis[x]=1;
    if(a[x]>=l&&a[x]<=r)ans=max(ans,b[x]);
    for(auto y:g[x])if(!vis[y])dfs(y,l,r);
}
int main(){
    freopen("recall.in","r",stdin);
    freopen("recall.out","w",stdout);
    cin>>T>>T;
    while(T--){
        cin>>n>>m>>q;
        for(int i=0; i<=n+4; i++)g[i].clear(),si[i]=vis[i]=rt[i]=0;
        for(int i=1; i<=m; i++){
            int u, v;
            cin>>u>>v;
            g[u].push_back(v);
        }
        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, z;
            cin>>op>>x>>y;
            if(op==1){
                swap(a[x],a[y]);
            }
            else if(op==2){
                swap(b[x],b[y]);
            }
            else{
                cin>>z;
                memset(vis,0,sizeof vis);
                ans=0;
                dfs(x,y,z);
                cout<<ans<<'\n';
            }
        }
    }
    return 0;
}