/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.09.30 17:52:17
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;


template < class Monoid >
struct SegmentTree {
private:
    using Func = std::function< Monoid(Monoid, Monoid) >;
    Func F;
    Monoid UNITY;
    int n;
    std::vector< Monoid > node;
    int _binary_search(int a, int b, const std::function<bool(Monoid)> &f, Monoid &s, int k = 0, int l = 0, int r = -1) {
        if (r < 0) r = n;
        if (r <= a || b <= l) return n;
        if (a <= l && r <= b && !f(F(s,node[k]))) {
            s = F(s,node[k]);
            return n;
        }
        if (l == r - 1) {s = F(s,node[k]); return l;}
        int ret = _binary_search(a, b, f, s, 2 * k + 1, l, (r - l) / 2 + l);
        return ret != n ? ret : _binary_search(a, b, f, s, 2 * k + 2, (r - l) / 2 + l, r);
    }
public:
    SegmentTree() {}
    SegmentTree(const std::vector< Monoid > &v, const Func f, const Monoid &unity) {
        F = f;
        UNITY = unity;
        int sz = v.size();
        n = 1;
        while (n < sz) n <<= 1;
        node.resize(n * 2 - 1, UNITY);
        for (int i = 0; i < sz; i++) node[i + n - 1] = v[i];
        build();
    }
    
    SegmentTree(int m, const Monoid &val, const Func f, const Monoid &unity) {
        F = f;
        UNITY = unity;
        n = 1;
        while (n < m) n <<= 1;
        node.resize(n * 2 - 1, UNITY);
        if (val != UNITY) {
            for (int i = 0; i < m; i++) node[i + n - 1] = val;
            build();
        }
    }
    
    void set(int k, const Monoid &x) {
        node[n + k - 1] = x;
    }
    void build() {
        for (int i = n - 2; i >= 0; i--) node[i] = F(node[2 * i + 1], node[2 * i + 2]);
    }
    void update_query(int x, const Monoid &val) {
        if (x >= n || x < 0) return;
        x += n - 1;
        node[x] = val;
        while (x > 0) {
            x = (x - 1) >> 1;
            node[x] = F(node[2 * x + 1], node[2 * x + 2]);
        }
    }
    
    Monoid get_query(int l, int r) {
        Monoid L = UNITY, R = UNITY;
        if (l < 0) l = 0;
        if (r < 0) return UNITY;
        if (l >= n) return UNITY;
        if (r >= n) r = n;
        for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if (l & 1) L = F(L, node[l++ - 1]);
            if (r & 1) R = F(node[--r - 1], R);
        }
        return F(L, R);
    }
    
    
    int binary_search(int l, int r, const std::function<bool(Monoid)> &f) {
        Monoid s = UNITY;
        int ret = _binary_search(l,r,f,s);
        return ret != n ? ret : -1;
    }
    Monoid operator[](int x) const {
        return node[n + x - 1];
    }
    int size() {
        return n;
    }
    void print() {
        for (int i = 0; i < n; i++) {
            std::cout << i << "\t: " << node[n + i - 1] << std::endl;
        }
    }
};
vector<vector<int>> g;
vector<int> c,a;
vector<int> l,r;
vector<int> saidai;
vector<pair<int,int>> euler_tour;
void dfs(int v, int p = -1, int depth = 0) {
    if (p != -1) saidai[v] = max(saidai[v],saidai[p]);
    euler_tour.push_back({depth,v});
    l[v] = euler_tour.size()-1;
    for(int u : g[v]) {
        if (u == p) continue;
        dfs(u,v,depth+1);
        euler_tour.push_back({depth,v});
    }
    r[v] = euler_tour.size()-1;
}
int main() {
    int n,k,q;cin >> n >> k >> q;
    g.resize(n);
    c.resize(n);
    a.resize(k);
    l.resize(n);
    r.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> c[i];
    }
    saidai = c;
    for (int i = 0; i < k; i++) {
        cin >> a[i];
    }
    for (int i = 0; i < n-1; i++) {
        int e,f;cin >> e >> f;
        g[e-1].push_back(f-1);
        g[f-1].push_back(e-1);
    }
    dfs(0);
    constexpr int INF = 1e9 + 6;
    
    SegmentTree<int> now_l(k,INF,[](int a,int b){return min(a,b);},INF);
    SegmentTree<int> now_r(k,0,[](int a,int b){return max(a,b);},0);
    for (int i = 0; i < k; i++) {
        now_l.set(i,l[a[i]-1]);
        now_r.set(i,r[a[i]-1]);
    }
    now_l.build(); now_r.build();
    SegmentTree<pair<int,int>> tour(euler_tour,[](pair<int,int> a, pair<int,int> b){return min(a,b);},{INF,INF});
    while(q--) {
        int t,x,y;cin >> t >> x >> y;
        x--;y--;
        if (t == 1) {
            now_l.update_query(x,l[y]);
            now_r.update_query(x,r[y]);
        }
        else {
            cout << saidai[tour.get_query(now_l.get_query(x,y+1),now_r.get_query(x,y+1)+1).second] << endl;
        }
    }
    
    
    
    
    
    return 0;
}