#include <bits/stdc++.h>
using namespace std;

struct LCA{
    static const int BITLEN_MAX = 20;
    vector<int> parent[BITLEN_MAX];
    vector<int> depth;
    int bitlen;

    LCA(){}
    LCA(int N, const vector<int> edges[]){ initialize(N, edges); }
    void initialize(int N, const vector<int> edges[]){
        int root = 0;
        bitlen = 1;
        while((1<<bitlen) < N) bitlen += 1;
        for(int i=0; i<bitlen; i++) parent[i].resize(N);
        depth.resize(N, -1);

        dfs(root, -1, 0, edges);
        for(int k=0; k<bitlen-1; k++){
            for(int v=0; v<N; v++){
                if(depth[v] == -1) continue;
                if(parent[k][v] < 0){
                    parent[k+1][v] = -1;
                }else{
                    parent[k+1][v] = parent[k][parent[k][v]];
                }
            }
        }
    }

    void dfs(int v, int p, int d, const vector<int> edges[]){
        parent[0][v] = p;
        depth[v] = d;
        for(auto u : edges[v]){
            if(u != p) dfs(u, v, d+1, edges);
        }
    }

    int calc_lca(int u, int v){
        if(depth[u] > depth[v]) swap(u, v);
        for(int k=0; k<bitlen; k++){
            if( ((depth[v]-depth[u]) >> k) & 1 ) v = parent[k][v];
        }
        if(u == v) return u;
        for(int k=bitlen-1; k>=0; k--){
            if(parent[k][u] != parent[k][v]){
                u = parent[k][u];
                v = parent[k][v];
            }
        }
        return parent[0][u];
    }

    int calc_dist(int u, int v){
        int l = calc_lca(u, v);
        return depth[u] + depth[v] - depth[l]*2;
    }
};

LCA lca;

template<typename T>
struct Segtree {
    int n, n_org;
    T e;
    vector<T> dat;
    typedef function<T(T a, T b)> Func;
    Func f;

    Segtree(){}
    Segtree(int n_input, Func f_input, T e_input){
        initialize(n_input, f_input, e_input);
    }
    void initialize(int n_input, Func f_input, T e_input){
        n_org = n_input;
        f = f_input;
        e = e_input;
        n = 1;
        while(n < n_input) n <<= 1;
        dat.resize(2*n-1, e);
    }

    void build(vector<T>& A){
        for(int k=0; k<int(A.size()); k++) dat[k+n-1] = A[k];
        for(int k=n-2; k>=0; k--) dat[k] = f(dat[2*k+1], dat[2*k+2]);
    }

    void update(int k, T a){
        k += n - 1;
        dat[k] = a;
        while(k > 0){
            k = (k - 1)/2;
            dat[k] = f(dat[2*k+1], dat[2*k+2]);
        }
    }

    T get(int k){
        return dat[k+n-1];
    }

    T between(int a, int b){
        return query(a, b+1, 0, 0, n);
    }

    T query(int a, int b, int k, int l, int r){
        if(r<=a || b<=l) return e;
        if(a<=l && r<=b) return dat[k];
        T vl = query(a, b, 2*k+1, l, (l+r)/2);
        T vr = query(a, b, 2*k+2, (l+r)/2, r);
        return f(vl, vr);
    }
};

int main(){
    int N, K, Q;
    cin >> N >> K >> Q;
    vector<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]--;
    vector<int> edges[100000];
    for(int i=0; i<N-1; i++){
        int a, b;
        cin >> a >> b;
        edges[b-1].push_back(a-1);
    }
    lca.initialize(N, edges);
    
    Segtree<int> st_lca(K, [](int a, int b){
        if(a == -1) return b;
        if(b == -1) return a;
        return lca.calc_lca(a, b);
    }, -1);
    for(int i=0; i<K; i++) st_lca.update(i, A[i]);

    auto dfs = [&](auto&& dfs, int i, int mx)->void{
        C[i] = max(C[i], mx);
        for(int j : edges[i]) dfs(dfs, j, C[i]);
    };
    dfs(dfs, 0, 0);

    while(Q--){
        int t;
        cin >> t;
        if(t == 1){
            int x, y;
            cin >> x >> y;
            x--; y--;
            st_lca.update(x, y);
        }else{
            int l, r;
            cin >> l >> r;
            l--; r--;
            int v = st_lca.between(l, r);
            cout << C[v] << endl;
        }
    }
    return 0;
}