#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int t=0;char h=getchar();
	while(!isdigit(h))h=getchar();
	while(isdigit(h))t=(t<<1)+(t<<3)+(h^48),h=getchar();
	return t;
}
void write(int x)
{
	if(x>9)write(x/10);putchar(x%10+'0');
}
const int N=1e5+10;
const int M=2e5+10;
int lk[N],to[M],nxt[M],len=0;
inline void insert(int x,int y)
{
	to[++len]=y;nxt[len]=lk[x];lk[x]=len;
}
bool vis[N];
int l,r;
int a[N],b[N],ans=0;
void dfs(int x)
{
	vis[x]=true;
	if(l<=a[x]&&a[x]<=r)ans=max(ans,b[x]);
	for(int i=lk[x],y;i;i=nxt[i])
		if(!vis[y=to[i]])dfs(y);
}
int n,m,q,x,y,op;
inline void solve()
{
	n=read();m=read();q=read();
	for(int i=1;i<=m;i++)x=read(),y=read(),insert(x,y);
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=n;i++)b[i]=read();
	for(int i=1;i<=q;i++)
	{
		op=read();x=read();
		if(op==1)
		{
			y=read();swap(a[x],a[y]);
		}
		else if(op==2)
		{
			y=read();swap(b[x],b[y]);
		}
		else
		{
			l=read();r=read();
			ans=0;
			for(int j=1;j<=n;j++)vis[j]=false;
			dfs(x);
			write(ans);puts("");
		}
	}
}
inline void reset()
{
	for(int i=1;i<=n;i++)lk[i]=0;
}
int main()
{
	freopen("recall.in","r",stdin);
	freopen("recall.out","w",stdout);
	
	int c=read(),t=read();
	while(t--)
	{
		solve();reset();
	}
	return 0;
}