#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;

template<typename Monoid,typename F>
class SegmentTree{
private:
    int sz;
    vector<Monoid> seg;
    const F op;
    const Monoid e;
public:
    SegmentTree(int n,const F op,const Monoid &e):op(op),e(e){
        sz = 1;
        while(sz<=n) sz <<= 1;
        seg.assign(2*sz,e);
    }
    void set(int k, const Monoid &x){
        seg[k+sz] = x;
    }
    void build(){
        for(int i=sz-1;i>0;i--){
            seg[i] = op(seg[2*i],seg[2*i+1]);
        }
    }
    void update(int k,const Monoid &x){
        k += sz;
        seg[k] = x;
        while(k>>=1){
            seg[k] = op(seg[2*k],seg[2*k+1]);
        }
    }
    Monoid query(int l,int r){
        Monoid L = e,R = e;
        for(l+=sz,r+=sz;l<r;l>>=1,r>>=1){
            if(l&1) L = op(L,seg[l++]);
            if(r&1) R = op(seg[--r],R);
        }
        return op(L,R);
    }
    Monoid operator[](const int &k)const{
        return seg[k+sz];
    }
};

class LeastCommonAncestor{
private:
    vector<vector<int>> v;
    vector<vector<int>> parent;
    vector<int> depth;
    int h = 0;
    void dfs(int n,int m,int d){
        parent[0][n] = m;
        depth[n] = d;
        for(auto x:v[n]){
            if(x!=m) dfs(x,n,d+1);
        }
    }
public:
    LeastCommonAncestor(int N,int root,vector<vector<int>>& tree){
        while((1<<h)<=N) h++;
        v = tree;
        parent = vector<vector<int>>(h,vector<int>(N,0));
        depth = vector<int>(N,0);
        dfs(root,-1,0);
        for(int j=0;j+1<h;j++){
            for(int i=0;i<N;i++){
                if(parent[j][i]<0) parent[j+1][i] = -1;
                else parent[j+1][i] = parent[j][parent[j][i]];
            }
        }
    }
    int lca(int n,int m){
        if(depth[n]>depth[m]) swap(n,m);
        for(int j=0;j<h;j++){
            if((depth[m]-depth[n]) >> j&1) m = parent[j][m];
        }
        if(n==m) return n;
        for(int j=h-1;j>=0;j--){
            if(parent[j][n]!=parent[j][m]){
                n = parent[j][n];
                m = parent[j][m];
            }
        }
        return parent[0][n];
    }
    int dep(int n){return depth[n];}
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,K,Q;
    cin >> N >> K >> Q;
    vec<int> C(N),A(K);
    for(int i=0;i<N;i++) cin >> C[i];
    for(int i=0;i<K;i++){
        cin >> A[i];
        A[i]--;
    }
    vvec<int> g(N);
    for(int i=0;i<N-1;i++){
        int a,b;
        cin >> a >> b;
        a--; b--;
        g[b].push_back(a);
    }
    LeastCommonAncestor LCA(N,0,g);
    auto dfs = [&](auto&& self,int cur,int par,int val)->void{
        C[cur] = max(C[cur],val);
        for(auto& to:g[cur]) if(to!=par){
            self(self,to,cur,C[cur]);
        }
    };
    dfs(dfs,0,-1,-1);

    auto op = [&](int a,int b){
        if(a==-1) return b;
        if(b==-1) return a;
        return LCA.lca(a,b);
    };
    SegmentTree<int,decltype(op)> seg(K,op,-1);
    for(int i=0;i<K;i++) seg.set(i,A[i]);
    seg.build();
    while(Q--){
        int t,a,b;
        cin >> t >> a >> b;
        a--; b--;
        if(t==1){
            seg.update(a,b);
        }else{
//            cerr << seg.query(a,b+1) << " ";
            cout << C[seg.query(a,b+1)] << "\n";
        }
    }


}