#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 55;
int c, T, n, m, tot, q;
int a[N], b[N], h[N], vis[N];
struct edge {
	int v, nxt;
} e[N];
void add(int x, int y) {
	e[++tot] = {y, h[x]};
	h[x] = tot;
}
int bfs(int u, int l, int r) {
	int ret = 0;
	vis[u] = 1;
	if (l <= a[u] and a[u] <= r) {
		ret = b[u];
	}
	for (int i = h[u]; i; i = e[i].nxt) {
		if (vis[e[i].v]) continue;
		ret = max(ret, bfs(e[i].v, l, r));
	}
	return ret;
}
int main() {
	freopen("recall.in", "r", stdin);
	freopen("recall.out", "w", stdout);
	scanf("%d%d", &c, &T);
	while (T--) {
		scanf("%d%d%d", &n, &m, &q);
		for (int i = 1; i <= n; i++) h[i] = 0; 
		for (int i = 1; i <= m; i++) {
			int x, y;
			scanf("%d%d", &x, &y);
			add(x, y);
		}
		for (int i = 1; i <= n; i++) {
			scanf("%d", &a[i]);
		}
		for (int i = 1; i <= n; i++) {
			scanf("%d", &b[i]);
		}
		while (q--) {
			int op;
			scanf("%d", &op);
			if (op == 1) {
				int x, y;
				scanf("%d%d", &x, &y);
				swap(a[x], a[y]);
			}
			else if(op == 2) {
				int x, y;
				scanf("%d%d", &x, &y);
				swap(b[x], b[y]);
			}
			else {
				int x, l, r;
				scanf("%d%d%d", &x, &l, &r);
				for (int i = 1; i <= n; i++) vis[i] = 0;
				printf("%d\n", bfs(x, l, r));
			}
		}
		
	}
	return 0;
}