#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

using pii = pair <int, int>;

const int N = 2e5 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int n, m, B, a[N], dfn[N], dn, sz[N], mx[N], mson[N], dep[N], ans[N], l, r;
int pool[N << 1], *fcur, *f[N], *gcur, *g[N], ca[N], cf[N];
vector <int> e[N];

struct node {
  int op, u, k;
} o[N];

void dfs0(int u, int fa) {
  dfn[u] = ++ dn, sz[u] = 1;
  for (int v : e[u]) if (v != fa) {
    dep[v] = dep[u] + 1, dfs0(v, u), sz[u] += sz[v];
    if (mx[v] + 1 > mx[u]) mx[u] = mx[v] + 1, mson[u] = v;
  }
}

void dfs1(int u, int fa) {
  f[u] = ++ fcur, g[u] = ++ gcur;
  if (mson[u]) dfs1(mson[u], u);
  for (int v : e[u]) if (v != fa && v != mson[u]) dfs1(v, u);
}

bool in(int u, int v) {
  return dfn[u] <= dfn[v] && dfn[v] < dfn[u] + sz[u];
}

void dfs2(int u, int fa) {
  f[u][0] = g[u][0] = a[u];
  if (mson[u]) dfs2(mson[u], u), g[u][0] ^= g[u][1];
  for (int v : e[u]) if (v != fa && v != mson[u]) {
    dfs2(v, u);
    rep(i, 0, mx[v]) f[u][i + 1] += f[v][i];
    drep(i, mx[v] + (mx[v] < mx[u]), 0) g[u][i] = g[u][i + 1] ^ f[u][i];
  }
  // cout << "------- u = " << u << endl;
  // pa(f[u], 0, mx[u]);
  // pa(g[u], 0, mx[u]);
  rep(i, l, r) if (o[i].op == 2 && o[i].u == u) {
    // pv(i);
    int res = g[u][0], lim = o[i].k;
    // cout << "lim, mx[u] = " << lim << ' ' << mx[u] << endl;
    // pv(res);
    if (lim < mx[u]) res ^= g[u][lim + 1];
    // pv(res);
    for (int j = l, v, d; j < i; ++ j)  {
      if (o[j].op == 1 && in(u, v = o[j].u) && (d = dep[v] - dep[u]) <= lim) {
        // pv(j);
        if (!~ca[v]) ca[v] = a[v];
        if (!~cf[d]) cf[d] = f[u][d];
        // cout << "d, cf[d] = " << d << ' ' << cf[d] << endl;
        res ^= cf[d], cf[d] -= a[v];
        a[v] = o[j].k;
        cf[d] += a[v], res ^= cf[d];
      }
    }
    for (int j = l, v, d; j < i; ++ j)  {
      if (o[j].op == 1 && in(u, v = o[j].u) && (d = dep[v] - dep[u]) <= lim) cf[d] = -1;
    }
    ans[i] = res;
  }
}

int main() {
  n = read(), m = read(), B = sqrt(m);
  rep(i, 0, n) ca[i] = cf[i] = -1;
  rep(i, 1, n) a[i] = read();
  rep(i, 1, n - 1) {
    int u = read(), v = read();
    e[u].emplace_back(v);
    e[v].emplace_back(u);
  }
  dfs0(1, 0);
  fcur = pool, gcur = pool + 2 * n;
  dfs1(1, 0);
  // pa(mson, 1, n);
  rep(i, 1, m) o[i].op = read(), o[i].u = read(), o[i].k = read();
  for (l = 1, r; l <= m; l = r + 1) {
    r = min(l + B - 1, m), dfs2(1, 0);
    rep(i, l, r) if (o[i].op == 1) a[o[i].u] = o[i].k;
  }
  rep(i, 1, m) if (o[i].op == 2) printf("%d\n", ans[i]);
  return 0;
}