#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef pair<db,db> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> bool ckmin(T& a, const T& b) {
return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) {
return a < b ? a = b, 1 : 0; }
int pct(int x) { return __builtin_popcount(x); }
int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x))
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0
int fstTrue(function<bool(int)> f, int lo, int hi) {
hi ++; assert(lo <= hi); // assuming f is increasing
while (lo < hi) { // find first index such that f is true
int mid = (lo+hi)/2;
f(mid) ? hi = mid : lo = mid+1;
}
return lo;
}
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) {
stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
str res = ""; F0R(i,SZ) res += char('0'+b[i]);
return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
bool fst = 1; str res = "{";
for (const auto& x: v) {
if (!fst) res += ", ";
fst = 0; res += ts(x);
}
res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
return "("+ts(p.f)+", "+ts(p.s)+")"; }
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) {
pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) {
pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << ts(h); if (sizeof...(t)) cerr << ", ";
DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
unsyncIO();
// cin.exceptions(cin.failbit);
// throws exception when do smth illegal
// ex. try to read letter into int
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
/**
* Description: 1D range minimum query. Can also do queries
* for any associative operation in $O(1)$ with D\&C
* Source: KACTL
* Verification:
* https://cses.fi/problemset/stats/1647/
* http://wcipeg.com/problem/ioi1223
* https://pastebin.com/ChpniVZL
* Memory: O(N\log N)
* Time: O(1)
*/
template<class T> struct RMQ { // floor(log_2(x))
int level(int x) { return 31-__builtin_clz(x); }
vector<T> v; vector<vi> jmp;
int comb(int a, int b) { // index of min
return v[a]==v[b]?min(a,b):(v[a]<v[b]?a:b); }
void init(const vector<T>& _v) {
v = _v; jmp = {vi(sz(v))}; iota(all(jmp[0]),0);
for (int j = 1; 1<<j <= sz(v); ++j) {
jmp.pb(vi(sz(v)-(1<<j)+1));
F0R(i,sz(jmp[j])) jmp[j][i] = comb(jmp[j-1][i],
jmp[j-1][i+(1<<(j-1))]);
}
}
int index(int l, int r) { // get index of min element
int d = level(r-l+1);
return comb(jmp[d][l],jmp[d][r-(1<<d)+1]); }
T query(int l, int r) { return v[index(l,r)]; }
};
/**
* Description: Euler Tour LCA. Compress takes a subset $S$ of nodes
* and computes the minimal subtree that contains all the nodes
* pairwise LCA's and compressing edges. Returns a list of
* \texttt{(par, orig\_index)} representing a tree rooted at 0.
* The root points to itself.
* Time: O(N\log N) build, O(1) LCA
* Source: USACO, Simon Lindholm (KACTL)
* Verification: USACO Debug the Bugs
* https://codeforces.com/contest/1320/problem/E
*/
template<int SZ> struct LCA {
int N, R = 1, depth[SZ], st[SZ];
vi adj[SZ]; vpi tmp; RMQ<pi> r;
void ae(int u, int v) { adj[u].pb(v), adj[v].pb(u); }
void dfs(int u, int p) {
st[u] = sz(tmp), depth[u] = depth[p]+1;
tmp.eb(depth[u],u);
trav(v,adj[u]) if (v != p)
dfs(v,u), tmp.eb(depth[u],u);
}
void init(int _N) { N = _N; dfs(R,0); r.init(tmp); }
int lca(int u, int v){
u = st[u], v = st[v]; if (u > v) swap(u,v);
return r.query(u,v).s; }
/// int dist(int u, int v) {
/// return depth[u]+depth[v]-2*depth[lca(u,v)]; }
vpi compress(vi S) {
static vi rev; rev.rsz(N+1);
auto cmp = [&](int a, int b) { return st[a] < st[b]; };
sort(all(S),cmp); R0F(i,sz(S)-1) S.pb(lca(S[i],S[i+1]));
sort(all(S),cmp); S.erase(unique(all(S)),end(S));
vpi ret{{0,S[0]}}; F0R(i,sz(S)) rev[S[i]] = i;
F0R(i,sz(S)-1) ret.eb(rev[lca(S[i],S[i+1])],S[i+1]);
return ret;
}
};
const int mx = 200005;
LCA<mx> tre;
int a[mx];
set<int> sing[mx];
set<int> inds[mx];
int main() {
setIO();
int n, m, q;
cin >> n >> m >> q;
for(int i = 0; i < n-1; i++){
int u, v;
cin >> u >> v;
tre.ae(u, v);
}
tre.init(n);
for(int i = 1; i <= m; i++){
cin >> a[i];
}
for(int i = 1; i <= m; i++){
sing[a[i]].ins(i);
if(i+1 <= m){
inds[tre.lca(a[i], a[i+1])].ins(i);
}
}
for(int i = 1; i <= q; i++){
int typ;
cin >> typ;
if(typ == 1){
int pos, v;
cin >> pos >> v;
sing[a[pos]].erase(pos);
if(pos-1 >= 1){
inds[tre.lca(a[pos-1], a[pos])].erase(pos-1);
}
if(pos+1 <= m){
inds[tre.lca(a[pos], a[pos+1])].erase(pos);
}
a[pos] = v;
sing[a[pos]].ins(pos);
if(pos-1 >= 1){
inds[tre.lca(a[pos-1], a[pos])].ins(pos-1);
}
if(pos+1 <= m){
inds[tre.lca(a[pos], a[pos+1])].ins(pos);
}
}
else{
int l, r, v;
cin >> l >> r >> v;
auto it = sing[v].lb(l);
if(it != sing[v].end() && *it <= r){
ps(*it, *it);
continue;
}
it = inds[v].lb(l);
if(it != inds[v].end() && *it+1 <= r){
ps(*it, *it+1);
continue;
}
ps(-1, -1);
continue;
}
}
// you should actually read the stuff at the bottom
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
*/
