#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

struct HLD {
  vector<int> label, parent, head;

  template<class graph>
  HLD(const graph &g) : label(g.size(), -1), parent(g.size()), head(g.size()) {
    const int n = g.size();
    vector<int> size(n);
    auto dfs = [&](auto dfs, int u, int p) -> void {
      size[u] = 1;
      for (int v : g[u]) if (v != p) {
        dfs(dfs, v, u);
        size[u] += size[v];
      }
    };
    for (int i = 0; i < n; i++) {
      if (size[i] == 0) dfs(dfs, i, -1);
    }
    int k = 0;
    auto dfs2 = [&](auto dfs, int u, int p, int h) -> void {
      label[u] = k++;
      head[u] = h;
      parent[u] = p;
      for (int v : g[u]) if (v != p && size[v] * 2 >  size[u]) dfs(dfs, v, u, h);
      for (int v : g[u]) if (v != p && size[v] * 2 <= size[u]) dfs(dfs, v, u, v);
    };
    for (int i = 0; i < n; i++) {
      if (label[i] == -1) dfs2(dfs2, i, -1, i);
    }
  }

  int lca(int u, int v) {
    for (;;) {
      if (label[u] > label[v]) swap(u, v);
      if (head[u] == head[v]) return u;
      v = parent[head[v]];
    }
  }

  template<class F> void each(int u, int v, F f) {
    for (;;) {
      if (label[u] > label[v]) swap(u, v);
      if (head[u] == head[v]) {
        f(label[u], label[v]);
        return;
      }
      f(label[head[v]], label[v]);
      v = parent[head[v]];
    }
  }

  template<class F> void each_edge(int u, int v, F f) {
    for (;;) {
      if (label[u] > label[v]) swap(u, v);
      if (head[u] == head[v]) {
        if (u != v) f(label[u] + 1, label[v]);
        return;
      }
      f(label[head[v]], label[v]);
      v = parent[head[v]];
    }
  }

  int operator[](int u) {
    return label[u];
  };
};

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int N, K, Q; cin >> N >> K >> Q;
  vector<int> C(N); rep(i, N) cin >> C[i];
  vector<int> A(K); rep(i, K) cin >> A[i], A[i]--;
  vector<vector<int>> G(N);
  rep(i, N - 1) {
    int u, v; cin >> u >> v; u--; v--;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  HLD hld(G);
  constexpr int U = 1 << 17;
  vector<int> seg(U * 2, 0);
  auto update = [&](int k, int v) {
    k += U;
    seg[k] = v;
    while (k > 1) {
      k >>= 1;
      seg[k] = hld.lca(seg[k * 2], seg[k * 2 + 1]);
    }
  };
  rep(i, K) update(i, A[i]);
  auto query = [&](int l, int r) {
    int res = A[l];
    l += U;
    r += U - 1;
    while (l <= r) {
      if ((l & 1) == 1) res = hld.lca(res, seg[l++]);
      if ((r & 1) == 0) res = hld.lca(res, seg[r--]);
      l >>= 1;
      r >>= 1;
    }
    return res;
  };
  vector<int> dp(N, INT_MIN);
  auto dfs = [&](auto dfs, int u, int p) -> void {
    dp[u] = max(dp[u], C[u]);
    for (int v : G[u]) if (v != p) {
      dp[v] = dp[u];
      dfs(dfs, v, u);
    }
  };
  dfs(dfs, 0, -1);
  while (Q--) {
    int type; cin >> type;
    if (type == 1) {
      int x, y; cin >> x >> y; x--; y--;
      A[x] = y;
      update(x, y);
    } else {
      int l, r; cin >> l >> r; l--;
      cout << dp[query(l, r)] << endl;
    }
  }
}