#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
const int mod = 1000000007;
const int N = 200005;
ll a[N+2], dp[N+2], sp[N+2][32], dep[N+2], par[N+2];
vector<int> adj[N+2];
void dfs(int n, int _par, int d){
dep[n] = d;
par[n] = _par;
for(auto i : adj[n]){
if(i == _par)continue;
dfs(i, n, d + 1);
}
}
void solve(){
int n, m, q;
cin>>n>>m>>q;
for(int i = 0; i < n - 1; i++){
int u, v;
cin>>u>>v;
adj[u].pb(v);
adj[v].pb(u);
}
for(int i = 0; i < m; i++){
cin>>a[i];
}
dfs(1, 0, 0);
// cerr<<__LINE__;
// return;
for(int i = 1; i <= n; i++){
sp[i][0] = par[i];
}
for(int j = 1; j < 30; j++){
for(int i = 1; i <= n; i++){
sp[i][j] = sp[sp[i][j - 1]][j - 1];
}
}
auto lca = [&](int u, int v) -> ll{
if(dep[u] < dep[v])swap(u, v);
if(dep[u] != dep[v]){
ll delta = dep[u] - dep[v];
for(int j = 0; j < 30; j++){
if((delta >> j) & 1){
u = sp[u][j];
}
}
}
if(u == v)return u;
for(int j = 0; j < 30; j++){
if(sp[u][j] != sp[v][j]){
u = sp[u][j];
v = sp[v][j];
}
}
return par[u];
};
while(q--){
int t;
cin>>t;
if(t == 1){
int u, v;
cin>>u>>v;
a[--u] = v;
}
else{
int l, r, v;
cin>>l>>r>>v;
for(int i = 1; i <= m; i++){
for(int l = 0, r = i; r < m; l++, r++){
ll cur = -1;
for(int k = l; k <= r; k++){
if(~cur)cur = lca(cur, a[k]);
else cur = a[k];
}
if(cur == v){
cout<<l+1<<' '<<r+1<<"\n"[!q];
goto done;
}
}
}
cout<<"-1 -1\n";
done:;
}
}
}
int main(){
cin.tie(0)->sync_with_stdio(0);
int tt = 1;
//cin>>tt;
while(tt--){
solve();
// cout<<'\n';
}
}
