#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<numeric>
#include<string>
#include<stack>
#include<queue>
#include<string.h>
#include<array>
#include<climits>
#include<algorithm>
#include<cmath>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define endl '\n'
const int maxn = 1e5 + 2;
const int Mx = 1e12;
const int oo = 1e18;
const int LG = 20;
int depth[maxn];
int up[maxn][LG];
vector<int> adj[maxn];
void dfs(int u, int p){
up[u][0] = p;
for(int i = 1; i < LG; i++){
up[u][i] = up[up[u][i - 1]][i - 1];
}
for(auto v : adj[u]){
if(v == p) continue;
depth[v] = depth[u] + 1;
dfs(v, u);
}
}
int lca(int u, int v){
if(depth[u] < depth[v]) swap(u, v);
int diff = depth[u] - depth[v];
for(int i = 0; i < LG; i++){
if(diff & (1 << i)){
u = up[u][i];
}
}
if(u == v) return u;
for(int i = LG - 1; i >= 0; i--){
if(up[u][i] != up[v][i]){
u = up[u][i];
v = up[v][i];
}
}
return up[u][0];
}
struct ST{
int n;
vector<int> tree;
ST(int size){
n = size;
tree.resize(4 * n);
}
int merge(int a, int b){
if(a == -1) return b;
if(b == -1) return a;
return lca(a, b);
}
void build(int node, int start, int end, vector<int>& a){
if(start == end){
tree[node] = a[start];
}
else{
int mid = (start + end) / 2;
build(2 * node, start, mid, a);
build(2 * node + 1, mid + 1, end, a);
tree[node] = merge(tree[2 * node], tree[2 * node + 1]);
}
}
int query(int node, int start, int end, int l, int r){
if(start > r || end < l) return -1;
if(start >= l && end <= r) return tree[node];
int mid = (start + end) / 2;
int l1 = query(2 * node, start, mid, l, r);
int r1 = query(2 * node + 1, mid + 1, end, l, r);
return merge(l1, r1);
}
void update(int node, int start, int end, int id, int val){
if(start == end){
tree[node] = val;
}
else{
int mid = (start + end) / 2;
if(mid >= id){
update(2 * node, start, mid, id, val);
}
else{
update(2 * node + 1, mid + 1, end, id, val);
}
tree[node] = merge(tree[2 * node], tree[2 * node + 1]);
}
}
};
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, k;
cin >> n >> m >> k;
for(int i = 0; i < n - 1; i++){
int a, b;
cin >> a >> b;
adj[a - 1].push_back(b - 1);
adj[b - 1].push_back(a - 1);
}
vector<int> a(m);
for(int i = 0; i < m; i++){
cin >> a[i];
a[i]--;
}
dfs(0, 0);
ST st(m);
st.build(1, 0, m - 1, a);
while(k--){
int t;
cin >> t;
if(t == 2){
int l, r, v;
cin >> l >> r >> v;
l--; r--; v--;
bool is = false;
for(int i = l; i <= r && !is; i++){
int L = i, hi = r;
int B = -1;
while(L <= hi){
int mid = (L + hi) / 2;
int cur = st.query(1, 0, m - 1, i, mid);
if(cur == v){
B = mid;
hi = mid - 1;
}
else{
if(depth[cur] >= depth[v]) L = mid + 1;
else hi = mid - 1;
}
}
if(B != -1){
cout << i + 1 << " " << B + 1 << endl;
is = true;
}
}
if(!is){
cout << "-1 -1" << endl;
}
}
else{
int pos, d;
cin >> pos >> d;
d--;
a[pos - 1] = d;
st.update(1, 0, m - 1, pos - 1, d);
}
}
}
