#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define popcount __builtin_popcountll
using namespace std;
vector<int> adj[2000], sub[2000];
int lca[2000][2000], in[2000], out[2000], par[2000][11], t = 0;
int a[2000];
void dfs(int u = 0, int p = -1) {
in[u] = t++;
sub[u] = {u};
lca[u][u] = u;
for (int v : adj[u]) if (v != p) {
par[v][0] = u;
for (int i = 1; i <= 10; i++)
par[v][i] = par[par[v][i-1]][i-1];
dfs(v, u);
for (int x : sub[v]) {
for (int y : sub[u]) {
lca[x][y] = lca[y][x] = u;
}
}
for (int x : sub[v]) sub[u].push_back(x);
}
out[u] = t++;
}
bool is_anc(int u, int v) {
return in[u] <= in[v] && out[v] <= out[u];
}
pair<int,int> solve(int l, int r, int u) {
int L = a[l], last = l;
if (L == u) return {l, l};
for (int i = l+1; i <= r; i++) {
L = lca[L][a[i]];
if (L == u) return {last, i};
if (!is_anc(u, L)) L = a[i], last = i;
}
return {-2, -2};
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n,m,q; 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();
// for (int i = 0; i < n; i++) {
// for (int j = 0; j < n; j++) {
// cout << i+1 << " " << j+1 << " " << 1+lca[i][j] << "\n";
// }
// }
for (int i = 0; i < m; cin>>a[i], a[i++]--);
while (q--) {
cin>>t;
if (t == 1) {
int i,x; cin>>i>>x;
a[--i] = --x;
} else {
int l,r,u; cin>>l>>r>>u;
auto [x, y] = solve(--l, --r, --u);
cout << 1+x << " " << 1+y << "\n";
}
}
}
