#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}
std::vector<int> score;
std::vector<std::vector<int> > childs;
std::vector<std::vector<int> > parent;
std::vector<int> depth;
void dfs(int i) {
	for (auto j : childs[i]) {
		depth[j] = depth[i] + 1;
		score[j] = std::max(score[j], score[i]);
		dfs(j);
	}
}
int lca(int a, int b) {
	if (a == -1) return b;
	if (b == -1) return a;
	if (depth[a] < depth[b]) std::swap(a, b);
	for (int k = 20; k--; ) if ((depth[a] - depth[b]) >> k & 1) a = parent[k][a];
	if (a == b) return a;
	for (int k = 20; k--; ) if (parent[k][a] != parent[k][b]) a = parent[k][a], b = parent[k][b];
	return parent[0][a];
}

struct SegTree {
	int n;
	std::vector<int> data;
	SegTree (const std::vector<int> &a) {
		for (n = 1; n < (int) a.size(); n <<= 1);
		data.resize(n << 1, -1);
		for (int i = 0; i < (int) a.size(); i++) data[i + n] = a[i];
		for (int i = n; --i; ) data[i] = lca(data[i << 1], data[i << 1 | 1]);
	}
	void assign(int i, int val) {
		for (data[i += n] = val; i >>= 1; ) data[i] = lca(data[i << 1], data[i << 1 | 1]);
	}
	int range_lca(int l, int r) {
		int res = -1;
		for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
			if (r & 1) res = lca(res, data[--r]);
			if (l & 1) res = lca(res, data[l++]);
		}
		return res;
	}
};

int main() {
	int n = ri(), k = ri(), q = ri();
	score.resize(n);
	for (auto &i : score) i = ri();
	
	std::vector<int> pos(k);
	for (auto &i : pos) i = ri() - 1;
	
	childs.resize(n);
	parent.resize(20, std::vector<int>(n, -1));
	for (int i = 1; i < n; i++) {
		int a = ri() - 1;
		int b = ri() - 1;
		childs[b].push_back(a);
		parent[0][a] = b;
	}
	depth.resize(n);
	dfs(0);
	for (int i = 1; i < 20; i++) for (int j = 0; j < n; j++) 
		parent[i][j] = parent[i - 1][j] == -1 ? -1 : parent[i - 1][parent[i - 1][j]];
	
	SegTree tree(pos);
	for (int i = 0; i < q; i++) {
		int t = ri();
		int x = ri() - 1;
		int y = ri() - 1;
		if (t == 1) tree.assign(x, y);
		else printf("%d\n", score[tree.range_lca(x, y + 1)]);
	}
	
	return 0;
}