#include <iostream>

#include <cmath>
#include <algorithm>

#include <iomanip>

#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>

#include <bitset>

#include <complex>

#include <cctype>
#include <utility>
#include <climits>

#include <numeric>

#include <functional>

using namespace std;
using ll = long long;
using P = pair<ll,ll>;

const ll MOD = 998244353;
const ll MODx = 1000000007;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<62LL)-1;
const double EPS = (1e-10);

P ar4[4] = {{0,1},{0,-1},{1,0},{-1,0}};
P ar8[8] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};




template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }
 
 /*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる

計算量は変わらないが楽できるシリーズ
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/

/*
function corner below
*/


/*
Function corner above
*/

/* comment outed because can cause bugs
__attribute__((constructor))
void initial() {
 cin.tie(0);
 ios::sync_with_stdio(false);
}
*/
template <typename T>
struct EulerTour {
  int n;
  vector<vector<int>> edge;
  vector<T> timeline;
  vector<pair<int,int>> stump;
  vector<pair<T,T>> value; 
  EulerTour(int n, vector<vector<int>> edge, vector<pair<T,T>> value):
    n(n), edge(edge), timeline(2*n, -1), stump(n, {-1,-1}), value(value), lock(n, false) {}

  void build(int top){
    timer = 0;
    lock.assign(n, false);
    lock[top] = true;
    dfs(top);
  }
  const T operator[](int index){
    return timeline[index].second;
  }
private:
  vector<bool> lock;
  int timer = 0;
  void dfs(int vertex){
    stump[vertex].first = timer;
    timeline[timer] = value[vertex].first;
    timer++;
    for(int i = 0; edge[vertex].size() > i; i++){
      if(!lock[edge[vertex][i]]){
        lock[edge[vertex][i]] = true;
        dfs(edge[vertex][i]);
      }
    }
    stump[vertex].second = timer;
    timeline[timer] = value[vertex].second;
    timer++;
  }
};

template< typename T, typename F>
struct SegmentTree{
  private:
    int n;
    vector<T> node;

    F f;
    T initer;

  public:
    SegmentTree(int n_, F f, T initer) : f(f),initer(initer) {
      n = 1;
      while(n < n_)n*=2;
      node.resize(2*n-1, initer);
    }

    SegmentTree(int n_, F f,T initer, vector<T> x) : f(f),initer(initer) {
      n = 1;
      while(n < n_)n*=2;
      node.resize(2*n-1, initer);
      set(x);
    }

    void set(vector<T> x){
      for(int i = 0; (int)x.size() > i; i++){
        update(i,x[i]);
      }
    }

    void update(int x, T val){
      x += (n-1);

      node[x] = val;

      while(x > 0){
        x = (x-1)/2;
        node[x] = f(node[2*x+1],node[2*x+2]);
      }
    }

    void add(int x, T val){
      x += (n-1);
      
      node[x] ^= val;
      while(x > 0){
        x = (x-1)/2;
        node[x] = f(node[2*x+1],node[2*x+2]);
      }
    }

    T getf(int a,int b, int k=0, int l=0, int r=-1){
      
      if(r < 0){
        r = n-1;
      }
      if(r < a || b < l){
        return initer;
      }
      if(a <= l && r <= b){
        return node[k];
      }

      T vl = getf(a,b,2*k+1,l,(l+r)/2);
      T vr = getf(a,b,2*k+2,(l+r)/2+1,r);
      return f(vl,vr);
    }

    void debug(){
      int nw = 1;
      int curr = 1;
      cout << "---begin---" << endl;
      for(int i = 0; 2*n-1 > i; i++){
        cout << node[i] << " ";
        if(nw == curr)cout << endl,nw *= 2, curr=1;
        else curr++;
      }
      cout << "---end---" << endl;
    }
};

template <typename T, typename F>
SegmentTree<T, F> get_segment_tree(int N, const F &f, T initer){
  return SegmentTree<T,F>{N,f,initer};
}

template <typename T, typename F>
SegmentTree<T, F> get_segment_tree(int N, const F &f, T initer, vector<T> x){
  return SegmentTree<T,F>{N,f,initer,x};
}

int main(){
  int n,q;cin>>n>>q;
  vector<pair<int, int>> A(n, {0,0});
  for(int i = 0; n > i; i++){
    cin>>A[i].first;
  }
  vector<vector<int>> edge(n);
  for(int i = 0; n-1 > i; i++){
    int a,b;cin>>a>>b;a--;b--;
    edge[a].push_back(b);
    edge[b].push_back(a);
  }
  EulerTour<int> X(n, edge, A);
  X.build(0);
  auto stump = X.stump;
  auto timeline = X.timeline;
  auto seg = get_segment_tree(timeline.size(), [](int a, int b){return (a^b);}, 0, timeline);
  for(int i = 0; q > i; i++){
    int t;cin>>t;
    if(t == 1){
      int x,y;cin>>x>>y;x--;
      seg.add(stump[x].first, y);
    }else{
      int x,y;cin>>x>>y;x--;
      cout << seg.getf(stump[x].first, stump[x].second) << endl;
    }
  }
  return 0;
}