/*
* Author: xynex
* Created: 20.12.2021 10:40
* Why am I so stupid? :c
* Slishkom slab
*/
#include <bits/stdc++.h>
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)
template<typename T> T get_rand(T l, T r) {
random_device rd;
mt19937 gen(rd());
return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }
string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }
template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }
void freop(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
void precalc() {
}
vt<int> g[N];
int tin[N], tout[N], timer, LOG;
int up[N][30];
void dfs(int v, int p) {
tin[v] = ++timer;
up[v][0] = p;
for (int i = 1; i <= LOG; ++i) up[v][i] = up[up[v][i-1]][i-1];
for (int to : g[v]) {
if (to == p) continue;
dfs(to, v);
}
tout[v] = ++timer;
}
bool is_ancestor(int u, int v) {
return tin[u] <= tin[v] && tout[u] >= tout[v];
}
int lca(int u, int v) {
if(is_ancestor(u, v)) return u;
if(is_ancestor(v, u)) return v;
for(int i = LOG; i >= 0; --i) {
if(!is_ancestor(up[u][i], v)) u = up[u][i];
}
return up[u][0];
}
int a[N];
multiset<int> whr[N], lcacontainer[N];
void solve() {
int n, m, q; read(n, m, q);
LOG = ceil(log2(n));
//print(LOG);
for(int i = 1; i < n; ++i) {
int l, r; read(l, r);
l--, r--;
g[l].pb(r);
g[r].pb(l);
}
dfs(0, 0);
for(int i = 1; i <= m; ++i) read(a[i]), a[i]--, whr[a[i]].insert(i);
for(int i = 1; i < m; ++i) {
int cur = lca(a[i], a[i + 1]);
//print(cur, i);
lcacontainer[cur].insert(i);
}
while(q--) {
int type; read(type);
if(type == 1) {
int pos, ind; read(pos, ind);
ind--;
if(pos != 1) lcacontainer[lca(a[pos - 1], a[pos])].erase(pos - 1);
if(pos < m) lcacontainer[lca(a[pos], a[pos + 1])].erase(pos);
whr[a[pos]].erase(pos);
a[pos] = ind;
if(pos != 1) lcacontainer[lca(a[pos - 1], a[pos])].insert(pos - 1);
if(pos < m) lcacontainer[lca(a[pos], a[pos + 1])].insert(pos);
whr[a[pos]].insert(pos);
}
else {
int l, r, ind; read(l, r, ind);
ind--;
auto finded = whr[ind].lower_bound(l);
if(finded != whr[ind].end() && (*finded) <= r && (*finded) >= l) {
print(*finded, *finded);
continue;
}
finded = lcacontainer[ind].lower_bound(l);
//print(*finded);
if(finded != whr[ind].end() && *finded <= (r - 1) && *finded >= l) {
print(*finded, *finded + 1);
continue;
}
print(-1, -1);
}
}
}
int main() {
//freop("");
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
//read(t);
precalc();
for (int i = 1; i <= t; ++i) {
//write("Case #" + to_string(i) + ": ");
solve();
}
return 0;
}
