#line 1 "/workspaces/compro/lib/atcoder/segtree.hpp"



#line 1 "/workspaces/compro/lib/atcoder/internal_bit.hpp"



#ifdef _MSC_VER
#include <intrin.h>
#endif

namespace atcoder {

namespace internal {

// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

}  // namespace internal

}  // namespace atcoder


#line 5 "/workspaces/compro/lib/atcoder/segtree.hpp"
#include <algorithm>
#include <cassert>
#include <vector>

namespace atcoder {

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
public:
  segtree() : segtree(0) {}
  segtree(int n) : segtree(std::vector<S>(n, e())) {}
  segtree(const std::vector<S> &v) : _n(int(v.size())) {
    log = internal::ceil_pow2(_n);
    size = 1 << log;
    d = std::vector<S>(2 * size, e());
    for (int i = 0; i < _n; i++)
      d[size + i] = v[i];
    for (int i = size - 1; i >= 1; i--) {
      update(i);
    }
  }

  void set(int p, S x) {
    assert(0 <= p && p < _n);
    p += size;
    d[p] = x;
    for (int i = 1; i <= log; i++)
      update(p >> i);
  }

  S get(int p) {
    assert(0 <= p && p < _n);
    return d[p + size];
  }

  S prod(int l, int r) {
    assert(0 <= l && l <= r && r <= _n);
    S sml = e(), smr = e();
    l += size;
    r += size;

    while (l < r) {
      if (l & 1)
        sml = op(sml, d[l++]);
      if (r & 1)
        smr = op(d[--r], smr);
      l >>= 1;
      r >>= 1;
    }
    return op(sml, smr);
  }

  S all_prod() { return d[1]; }

  template <bool (*f)(S)> int max_right(int l) {
    return max_right(l, [](S x) { return f(x); });
  }
  template <class F> int max_right(int l, F f) {
    assert(0 <= l && l <= _n);
    assert(f(e()));
    if (l == _n)
      return _n;
    l += size;
    S sm = e();
    do {
      while (l % 2 == 0)
        l >>= 1;
      if (!f(op(sm, d[l]))) {
        while (l < size) {
          l = (2 * l);
          if (f(op(sm, d[l]))) {
            sm = op(sm, d[l]);
            l++;
          }
        }
        return l - size;
      }
      sm = op(sm, d[l]);
      l++;
    } while ((l & -l) != l);
    return _n;
  }

  template <bool (*f)(S)> int min_left(int r) {
    return min_left(r, [](S x) { return f(x); });
  }
  template <class F> int min_left(int r, F f) {
    assert(0 <= r && r <= _n);
    assert(f(e()));
    if (r == 0)
      return 0;
    r += size;
    S sm = e();
    do {
      r--;
      while (r > 1 && (r % 2))
        r >>= 1;
      if (!f(op(d[r], sm))) {
        while (r < size) {
          r = (2 * r + 1);
          if (f(op(d[r], sm))) {
            sm = op(d[r], sm);
            r--;
          }
        }
        return r + 1 - size;
      }
      sm = op(d[r], sm);
    } while ((r & -r) != r);
    return 0;
  }

private:
  int _n, size, log;
  std::vector<S> d;

  void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

} // namespace atcoder


#line 1 "/workspaces/compro/lib/template.hpp"


#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#line 3 "/workspaces/compro/lib/io/vector.hpp"

#ifndef IO_VECTOR
#define IO_VECTOR

template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
  int size = v.size();
  for (int i = 0; i < size; i++) {
    std::cout << v[i];
    if (i != size - 1)
      std::cout << " ";
  }
  return out;
}

template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {
  for (auto &el : v) {
    std::cin >> el;
  }
  return in;
}

#endif
#line 4 "/workspaces/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<

using namespace std;

template <class T> void chmin(T &a, T b) {
  if (a > b)
    a = b;
}

template <class T> void chmax(T &a, T b) {
  if (a < b)
    a = b;
}

// 重複を消す。計算量はO(NlogN)
template <class T> void unique(std::vector<T> &v) {
  std::sort(v.begin(), v.end());
  v.erase(std::unique(v.begin(), v.end()), v.end());
}


#line 3 "main.cpp"

int op(int a, int b) { return a + b; }

int e() { return 0; }

void solve(ll N, ll Q, const std::vector<int> &C, const std::vector<long long> &a, const std::vector<long long> &b,
           const std::vector<long long> &T, const std::vector<long long> &x, const std::vector<int> &y) {

  vector<vector<int>> g(N);
  REP(i, N - 1) {
    g[a[i]].push_back(b[i]);
    g[b[i]].push_back(a[i]);
  }

  // Euler Tour
  vector<int> in(N, 0), out(N, 0);

  vector<int> v;

  auto dfs = [&](int cur, int par, auto self) -> void {
    in[cur] = v.size();
    v.push_back(cur);
    for (const auto &el : g[cur]) {
      if (el == par)
        continue;
      self(el, cur, self);
    }
    out[cur] = v.size();
    v.push_back(cur);
  };
  dfs(0, -1, dfs);

  // セグ木の準備
  vector<atcoder::segtree<int, op, e>> segs(10);
  REP(k, 10) {
    vi tmp;
    for (const auto &el : v) {
      tmp.push_back((C[el] >> k) % 2);
    }
    segs[k] = atcoder::segtree<int, op, e>(tmp);
  }

  REP(i, Q) {
    if (T[i] == 1) {
      REP(k, 10) {
        segs[k].set(in[x[i]], segs[k].get(in[x[i]]) + (y[i] >> k) % 2);
        segs[k].set(out[x[i]], segs[k].get(out[x[i]]) + (y[i] >> k) % 2);
      }
    } else {
      int ans = 0;
      REP(k, 10) { ans += ((segs[k].prod(in[x[i]], out[x[i]] + 1) / 2) % 2) << k; }
      cout << ans << endl;
    }
  }
}

// generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N, Q;
  std::cin >> N;
  std::vector<int> C(N);
  vl a(N - 1), b(N - 1);
  std::cin >> Q;
  std::vector<long long> T(Q), x(Q);
  vi y(Q);
  for (int i = 0; i < N; ++i) {
    std::cin >> C[i];
  }
  for (int i = 0; i < N - 1; ++i) {
    std::cin >> a[i] >> b[i];
    a[i]--;
    b[i]--;
  }
  for (int i = 0; i < Q; ++i) {
    std::cin >> T[i] >> x[i] >> y[i];
    x[i]--;
  }
  solve(N, Q, C, a, b, T, x, y);
  return 0;
}