#include<cstdio>
#include<bitset>
#define N 2005
#define ll long long
using namespace std;
int T,n,m,q,a[N],b[N],op,x,y,z,sum;
bitset<N>v[N];
int swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
int main(){
    freopen("recall.in","r",stdin);freopen("recall.out","w",stdout);
    read();T=read();
    while(T--)
    {
        n=read();m=read();q=read();
        while(m--)x=read(),y=read(),v[x][y]=1;
        for(int i=1;i<=n;i++)v[i][i]=1;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                if(v[j][i])
                    v[j]|=v[i];
        for(int i=1;i<=n;i++)a[i]=read();
        for(int i=1;i<=n;i++)b[i]=read();
        while(q--)
        {
            op=read();
            switch(op)
            {
                case 1:x=read();y=read();swap(a[x],a[y]);break;
                case 2:x=read();y=read();swap(b[x],b[y]);break;
                case 3:z=read();x=read();y=read();
                    sum=0;
                    for(int i=1;i<=n;i++)
                        if(v[z][i]&&a[i]>=x&&a[i]<=y)
                            sum=max(sum,b[i]);
                printf("%d\n",sum);
            }
        }
    }
    return 0;
}