#include<bits/stdc++.h>
using namespace std;
#define N 200005
struct A{
int v,l,r;
bool operator<(const A& o)const{
if(v!=o.v)return v<o.v;
if(l!=o.l)return l<o.l;
return r<o.r;
}
};
int dep[N],bp[20][N],val[N];
vector<int> g[N];
multiset<A> s;
void dfs(int s,int f){
dep[s]=dep[f]+1;
bp[0][s]=f;
for(auto x:g[s])if(x!=f)dfs(x,s);
}
int lca(int a,int b){
if(dep[a]>dep[b])swap(a,b);
int i,dif=dep[b]-dep[a];
for(i=0;i<20;i++)if(dif&(1<<i))b=bp[i][b];
if(a==b)return a;
for(i=19;i>=0;i--)if(bp[i][a]!=bp[i][b]){
a=bp[i][a];
b=bp[i][b];
}
return bp[0][a];
}
int main(){
int n,m,q,i,j,a,b,op,pos,v,l,r;
scanf("%d %d %d",&n,&m,&q);
for(i=1;i<n;i++){
scanf("%d %d",&a,&b);
g[a].push_back(b);
g[b].push_back(a);
}
for(i=1;i<=m;i++)scanf("%d",&val[i]),s.insert({val[i],i,i});
dfs(1,0);
for(i=1;i<20;i++)for(j=1;j<=n;j++)bp[i][j]=bp[i-1][bp[i-1][j]];
for(i=2;i<=n;i++)s.insert({lca(val[i],val[i-1]),i-1,i});
while(q--){
scanf("%d",&op);
if(op==1){
scanf("%d %d",&pos,&v);
s.erase(s.find({val[pos],pos,pos}));
if(pos>1)s.erase(s.find({lca(val[pos],val[pos-1]),pos-1,pos}));
if(pos<m)s.erase(s.find({lca(val[pos],val[pos+1]),pos,pos+1}));
val[pos]=v;
s.insert({val[pos],pos,pos});
if(pos>1)s.insert({lca(val[pos],val[pos-1]),pos-1,pos});
if(pos<m)s.insert({lca(val[pos],val[pos+1]),pos,pos+1});
}
else{
scanf("%d %d %d",&l,&r,&v);
auto it=s.lower_bound({v,l,-1});
A x=*it;
if(x.v==v&&l<=x.l&&x.r<=r)printf("%d %d\n",x.l,x.r);
else printf("-1 -1\n");
}
}
return 0;
}
