#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using pi=pair<int,int>;
const int N=100005;
int n,m,q,a[N],b[N];
vector<int>g[N];
bitset<N>vis;
int bfs(int s,int l,int r)
{
    vis.reset();
    int ans=0;
    queue<int>q;
    q.push(s);
    vis[s]=1;
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        if(l<=a[u]&&a[u]<=r)ans=max(ans,b[u]);
        for(auto v:g[u])
        {
            if(vis[v]==0)
            {
                vis[v]=1;
                q.push(v);
            }
        }
    }
    return ans;
}
void solve()
{
    cin>>n>>m>>q;
    for(int i=1;i<=n;i++)g[i].clear();
    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;
            cout<<bfs(x,y,z)<<'\n';
        }
    }
}
int main()
{
    freopen("recall.in","r",stdin);
    freopen("recall.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int sid,t;
    cin>>sid>>t;
    while(t--)solve();
    return 0;
}