#include <bits/stdc++.h>
using namespace std;
#define Task ""
struct __Init__ {
__Init__() {
cin.tie(nullptr)->sync_with_stdio(false);
if (fopen(Task".inp", "r")) {
freopen(Task".inp", "r", stdin);
freopen(Task".out", "w", stdout); }
}
} __init__;
using ll = long long;
#ifdef LOCAL
#define debug(x) cerr << "[" #x " = " << x << "]\n";
#else
#define debug(...)
#endif // LOCAL
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define For(i, l, r) for (int i = (l); i <= (r); ++i)
#define Ford(i, r, l) for (int i = (r); i >= (l); --i)
#define Rep(i, n) For (i, 0, (n) - 1)
#define Repd(i, n) Ford (i, (n) - 1, 0)
template<class C> int isz(const C& c) { return c.size(); }
template<class T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }
constexpr int eps = 1e-9;
constexpr int inf = 1e9;
constexpr ll linf = 1e18;
// =============================================================================
constexpr int maxN = 2e5 + 5;
constexpr int logN = 20;
int n, m, nq;
vector<int> g[maxN];
int a[maxN];
int par[maxN][logN];
int dep[maxN];
int tree[maxN << 2];
void Dfs(int u) {
for (int v : g[u]) if (v != par[u][0]) {
par[v][0] = u;
dep[v] = dep[u] + 1;
Dfs(v);
}
}
int getLca(int u, int v) {
if (dep[u] < dep[v]) swap(u, v);
Repd (i, logN) if ((dep[u] - dep[v]) >> i & 1) {
u = par[u][i];
}
if (u == v) return u;
Repd (i, logN) if (par[u][i] != par[v][i]) {
u = par[u][i];
v = par[v][i];
}
return par[u][0];
}
#define m ((l + r) >> 1)
#define tl (i << 1)
#define tr (i << 1 | 1)
void build(int i, int l, int r) {
if (l == r) {
tree[i] = a[l];
return;
}
build(tl, l, m);
build(tr, m + 1, r);
tree[i] = getLca(tree[tl], tree[tr]);
}
void update(int p, int x, int i, int l, int r) {
if (p < l || r < p) return;
if (l == r) {
tree[i] = x;
return;
}
update(p, x, tl, l, m);
update(p, x, tr, m + 1, r);
tree[i] = getLca(tree[tl], tree[tr]);
}
int get(int u, int v, int i, int l, int r) {
if (v < l || r < u) return 0;
if (u <= l && r <= v) return tree[i];
int left = get(u, v, tl, l, m);
int right = get(u, v, tr, m + 1, r);
if (!left) left = right;
if (!right) right = left;
return getLca(left, right);
}
#undef m
#undef tl
#undef tr
signed main() {
cin >> n >> m >> nq;
Rep (_, n - 1) {
int u, v; cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
For (i, 1, m) cin >> a[i];
Dfs(1);
For (j, 1, logN - 1) {
For (i, 1, n) {
par[i][j] = par[par[i][j - 1]][j - 1];
}
}
build(1, 1, m);
Rep (_, nq) {
int op; cin >> op;
if (op == 1) {
int p, x; cin >> p >> x;
update(p, x, 1, 1, m);
} else {
int l, r, v; cin >> l >> r >> v;
int ansL = -1, ansR = -1;
int pL = l, pR = l;
while (pL <= r && pR <= r) {
if (pL > pR) pR = pL;
int lca = get(pL, pR, 1, 1, m);
if (lca == v) {
ansL = pL;
ansR = pR;
break;
}
if (dep[lca] < dep[v]) {
++pL;
} else {
++pR;
}
}
cout << ansL << ' ' << ansR << '\n';
}
}
}
/*
*/
