#include <bits/stdc++.h>
using namespace std;

const int N = 2e3 + 10;
int C, T, n, m, Q, a[N], b[N];
bool f[N][N];
vector<int> ed[N];
queue<int> q;

void bfs(int S){
	q.push(S), f[S][S] = true;
	while(!q.empty()){
		int x = q.front();
		q.pop();
		for(auto y : ed[x]){
			if(f[S][y]) continue;
			f[S][y] = true, q.push(y);
		}
	}
	return;
}

signed main()
{
	freopen("recall.in","r",stdin);
	freopen("recall.out","w",stdout);
	cin >> C >> T;
	while(T--){
		scanf("%d%d%d", &n, &m, &Q);
		for(int i = 1; i <= n; ++i){
			ed[i].clear();
			for(int j = 1; j <= n; ++j) f[i][j] = false;
		}
		for(int i = 1, st, en; i <= m; ++i) scanf("%d%d", &st, &en), ed[st].push_back(en);
		for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
		for(int i = 1; i <= n; ++i) scanf("%d", &b[i]);
		for(int i = 1; i <= n; ++i) bfs(i);
		while(Q--){
			int op, x, y, l, r;
			scanf("%d%d", &op, &x);
			if(op == 1) scanf("%d", &y), swap(a[x], a[y]);
			else if(op == 2) scanf("%d", &y), swap(b[x], b[y]);
			else{
				scanf("%d%d", &l, &r);
				int res = 0;
				for(int i = 1; i <= n; ++i)
					if(a[i] >= l && a[i] <= r && f[x][i]) res = max(res, b[i]);
				printf("%d\n", res);
			}
		}
	}
	return 0;
}