#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define endi puts("");
const int N = 2e5+12,INF=1e18+7;
int q[N],up[N][40],tin[N],tout[N],cnt,der[4*N];
vector <int> g[N];
void dfs(int x,int p){
int i;
tin[x]=++cnt;
up[x][0]=p;
for (i=1;i<20;++i)
up[x][i]= up[up[x][i-1]][i-1];
for (i=0;i<g[x].size();++i){
if (g[x][i] != p){
dfs(g[x][i],x);
}
}
tout[x] = ++cnt;
}
bool upper(int a,int b){
ret (tin[a] <= tin[b] && tout[a] >= tout[b]);
}
int lca(int a,int b){
int i;
if (upper(a,b))ret a;
if (upper(b,a))ret b;
for(i=19;i>=0;--i){
if (!upper(up[a][i],b)){
a = up[a][i];
}
}
ret up[a][0];
}
/*
void build(int v,int l,int r){
if (l == r){
der[v] = q[l];
}
else {
int m = l+r>>1;
build(v<<1,l,m);
build((v<<1)+1,m+1,r);
der[v] = lca(der[v<<1],der[(v<<1)+1]);
}
}
void update(int v,int l,int r,int x,int y){
if (l == r){
der[v]=y;
}
else {
int m = l+r>>1;
if (m < x){
update((v<<1)+1,m+1,r,x,y);
}
else update(v<<1,l,m,x,y);
der[v] = lca(der[v<<1],der[(v<<1)+1]);
}
}
int get_ans(int v,int l,int r,int ql,int qr){
if (ql <= l && r <= qr)ret der[v];
if (ql > r || qr < l)ret 0;
else {
int m = l+r>>1;
int x = get_ans(v<<1,l,m,ql,qr);
int y = get_ans((v<<1)+1,m+1,r,ql,qr);
if (x == 0)ret y;
if (y == 0)ret x;
ret lca(x,y);
}
}
*/
main(){
int n,m,t,i,j,mm;
scan3(n,m,t)
for (i=1;i<n;++i){
int x,y;
scan2(x,y)
g[x].pb(y);
g[y].pb(x);
}
dfs(1,1);
for (i=1;i<=m;++i)
scan1(q[i])
while (t--){
int type;
scan1(type)
if (type==1){
int l,r;
scan2(l,r)
q[l]=r;
}
else {
int l,r,v,ll=-1,rr=-1;
scan3(l,r,v)
for (i=l;i<=r;++i){
int lc = q[i];
for (j=i;j<=r;++j){
lc =lca(lc,q[j]);
if (lc == v){
ll = i;
rr = j;
break;
}
}
}
printf("%d %d\n",ll,rr);
}
}
}
