#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, q; cin>>n>>m>>q;
vector<int> g[n + 1];
for (int i = 1; i < n; i++){
int u, v; cin>>u>>v;
g[u].pb(v);
g[v].pb(u);
}
const int lg = log2(n);
vector<vector<int>> pw(n + 1, vector<int>(lg + 1));
vector<int> tin(n + 1), tout(n + 1);
int timer = 0;
function<void(int, int)> fill = [&](int v, int pr){
tin[v] = ++timer;
pw[v][0] = pr;
for (int i = 1; i <= lg; i++){
pw[v][i] = pw[pw[v][i - 1]][i - 1];
}
for (int i: g[v]){
if (i == pr) continue;
fill(i, v);
}
tout[v] = timer;
};
fill(1, 1);
auto check = [&](int x, int y){
return (tin[x] <= tin[y] && tout[x] >= tout[y]);
};
auto lca = [&](int x, int y){
if (check(x, y)) return x;
if (check(y, x)) return y;
for (int i = lg; i >= 0; i--){
if (!check(pw[x][i], y)){
x = pw[x][i];
}
}
return pw[x][0];
};
vector<int> a(m + 1);
for (int i = 1; i <= m; i++){
cin>>a[i];
}
while (q--){
int type; cin>>type;
if (type == 1){
int p, v; cin>>p>>v;
a[p] = v;
}
else {
int l, r, v; cin>>l>>r>>v;
int l1 = -1, r1 = -1;
for (int i = l; i <= r; i++){
if (a[i] == v){
l1 = r1 = i;
break;
}
}
if (l1 != -1){
cout<<l1<<" "<<r1<<"\n";
continue;
}
for (int i = l; i + 1 <= r; i++){
if (lca(a[i], a[i + 1]) == v){
l1 = i; r1 = i + 1;
break;
}
}
cout<<l1<<" "<<r1<<"\n";
}
}
}
