#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
const int LOGN = 19;
vector<int> adj[MAXN];
int tin[MAXN], tout[MAXN], timer;
int up[MAXN][LOGN];
int a[MAXN];
int n, m, q;
void dfs(int v, int p) {
tin[v] = ++timer;
up[v][0] = p;
for (int i = 1; i < LOGN; i++) {
up[v][i] = up[up[v][i - 1]][i - 1];
}
for (int u : adj[v]) {
if (u == p) continue;
dfs(u, v);
}
tout[v] = timer;
}
bool is_ancestor(int u, int v) {
return tin[u] <= tin[v] && tout[u] >= tout[v];
}
int get_lca(int u, int v) {
if (u == 0) return v;
if (v == 0) return u;
if (is_ancestor(u, v)) return u;
if (is_ancestor(v, u)) return v;
for (int i = LOGN - 1; i >= 0; i--) {
if (!is_ancestor(up[u][i], v)) {
u = up[u][i];
}
}
return up[u][0];
}
struct Node {
int lca_val;
int min_t, max_t;
int x, y;
};
Node merge(Node l, Node r) {
if (l.lca_val == 0) return r;
if (r.lca_val == 0) return l;
return {get_lca(l.lca_val, r.lca_val), min(l.min_t, r.min_t), max(l.max_t, r.max_t), l.x, r.y};
}
Node tree[4 * MAXN];
void build(int node, int start, int end) {
if (start == end) {
tree[node] = {a[start], tin[a[start]], tin[a[start]], start, start};
return;
}
int mid = (start + end) / 2;
build(2 * node, start, mid);
build(2 * node + 1, mid + 1, end);
tree[node] = merge(tree[2 * node], tree[2 * node + 1]);
}
void update(int node, int start, int end, int pos, int val) {
if (start == end) {
tree[node] = {val, tin[val], tin[val], start, start};
return;
}
int mid = (start + end) / 2;
if (pos <= mid) update(2 * node, start, mid, pos, val);
else update(2 * node + 1, mid + 1, end, pos, val);
tree[node] = merge(tree[2 * node], tree[2 * node + 1]);
}
Node range_query(int node, int start, int end, int l, int r) {
if (r < start || end < l) return {0, (int)2e9, -1, -1, -1};
if (l <= start && end <= r) return tree[node];
int mid = (start + end) / 2;
return merge(range_query(2 * node, start, mid, l, r), range_query(2 * node + 1, mid + 1, end, l, r));
}
pair<int, int> find_pair(int node, int start, int end, int l, int r, int v) {
if (r < start or end < l) return {-1, -1};
Node cur = tree[node];
if (l <= start and end <= r) {
if (tin[v] <= cur.min_t and cur.max_t <= tout[v]) {
if (cur.lca_val == v) return {start, end};
return {-1, -1};
}
}
if (start == end) return {-1, -1};
int mid = (start + end) / 2;
pair<int, int> res = find_pair(2 * node, start, mid, l, r, v);
if (res.first != -1) return res;
res = find_pair(2 * node + 1, mid + 1, end, l, r, v);
if (res.first != -1) return res;
Node ql = range_query(2 * node, start, mid, l, r);
Node qr = range_query(2 * node + 1, mid + 1, end, l, r);
if (ql.lca_val != 0 and qr.lca_val != 0) {
if (tin[v] <= ql.min_t and ql.max_t <= tout[v] && tin[v] <= qr.min_t and qr.max_t <= tout[v]) {
if (get_lca(ql.lca_val, qr.lca_val) == v) return {ql.x, qr.y};
}
}
return {-1, -1};
}
int main() {
cin.tie(0)->sync_with_stdio(false);
cin >> n >> m >> q;
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
dfs(1, 1);
for (int i = 1; i <= m; i++) {
cin >> a[i];
}
build(1, 1, m);
while (q--) {
int type;
cin >> type;
if (type == 1) {
int pos, val;
cin >> pos >> val;
update(1, 1, m, pos, val);
} else {
int l, r, v;
cin >> l >> r >> v;
pair<int, int> ans = find_pair(1, 1, m, l, r, v);
cout << ans.first << " " << ans.second << "\n";
}
}
}
