#include"bits/stdc++.h"
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
const long long inf = 1e17;
int c[100006], a[100005];
int par[20][100006];
int d[100006];
vector<int>G[100005];

void dfs(int now, int parn) {
	par[0][now] = parn;
	for (int e : G[now]) {
		c[e] = max(c[e], c[now]);
		d[e] = d[now] + 1;
		dfs(e, now);
	}
}
void init(int N) {
	dfs(0, -1);
	rep(k, 19) {
		rep(v, N) {
			if (par[k][v] < 0)par[k + 1][v] = -1;
			else par[k + 1][v] = par[k][par[k][v]];
		}
	}
}
int lca(int u, int v) {
	if (u == -1 && v == -1)return -1;
	else if (u == -1)return v;
	else if (v == -1)return u;
	if (d[u] > d[v])swap(u, v);
	rep(k, 19) {
		if ((d[v] - d[u]) >> k & 1)v = par[k][v];
	}
	if (u == v)return u;
	for (int k = 18; k >= 0; k--) {
		if (par[k][u] != par[k][v]) {
			u = par[k][u]; v = par[k][v];
		}
	}
	return par[0][u];
}

struct segtree {
	vector<int>node; int n;
	void init(int N) {
		n = 1;
		while (n < N)n *= 2;
		node.resize(2 * n, -1);
	}
	void upd(int a, int x) {
		a += n - 1;
		node[a] = x;
		while (a > 0) {
			a = (a - 1) / 2;
			node[a] = lca(node[2 * a + 1], node[2 * a + 2]);
		}
	}
	int calc(int a, int b, int k, int l, int r) {
		if (r <= a || b <= l)return -1;
		if (a <= l&&r <= b)return node[k];
		return lca(calc(a, b, k * 2 + 1, l, (l + r) / 2), calc(a, b, k * 2 + 2, (l + r) / 2, r));
	}
	int get(int a, int b) {
		return calc(a, b, 0, 0, n);
	}
};
segtree S;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n, k, q; cin >> n >> k >> q;
	rep(i, n)cin >> c[i];
	rep(i, k)cin >> a[i];
	rep(i, n - 1) {
		int e, f; cin >> e >> f;
		e--; f--;
		G[f].push_back(e);
	}
	init(n);
	S.init(k);
	rep(i, k)S.upd(i, a[i]-1);
	rep(i, q) {
		int t, l, r; cin >> t >> l >> r;
		if (t == 1) {
			S.upd(l - 1, r - 1);
		}
		else {
			cout <<c[S.get(l - 1, r)] << endl;
		}
	}
}