#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
vector<int> p[maxn];
vector<int> p1[maxn];
int a[maxn];
int b[maxn];
int vis[maxn];
int a1,b1,c1,d1;
int ans = 0;
void dfs(int u) {
	vis[u] = 1;
	if(c1 <= a[u] && a[u] <= d1) {
		//cout<<v<<endl;
		ans = max(ans,b[u]);
	}
	for(int i = 0;i < p[u].size();i++) {
		int v = p[u][i];
		if(!vis[v]) {
			dfs(v);
		}
	}
}
signed main() {
	freopen("recall.in","r",stdin);
	freopen("recall.out","w",stdout);
	int w,t;
	cin>>w>>t;
	while(t--) {
		int n,m,q;
		cin>>n>>m>>q;
		int x,y;
		for(int i = 1;i <= m;i++) {
			cin>>x>>y;
			p[x].push_back(y);
		}
		for(int i = 1;i <= n;i++) {
			cin>>a[i];
		}
		for(int i = 1;i <= n;i++) {
			cin>>b[i];
		}
		for(int i = 1;i <= q;i++) {
			cin>>a1>>b1>>c1;
			if(a1 == 1) {
				swap(a[b1],a[c1]);
			} else if(a1 == 2) {
				swap(b[b1],b[c1]);
			} else {
				cin>>d1;
				ans = 0;
				dfs(b1);
				cout<<ans<<endl;
				for(int i = 1;i <= n;i++) {
					vis[i] = 0;
				}
			}
		}
		for(int i = 1;i <= n;i++) {
			p[i].clear();
		}
	}
	return 0;
}