#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

struct HLD{
   using P=pair<int,int>;
   vector<vector<int>> g; vector<int> sz,in,out,hs,par;
   void dfs(int v,int p){
      par[v]=p; sz[v]=1;
      if(!g[v].empty() and g[v][0]==p)swap(g[v][0],g[v].back());
      for(auto& to:g[v])if(to!=p){
         dfs(to,v); sz[v]+=sz[to];
         if(sz[g[v][0]]<sz[to])swap(g[v][0],to);
      }
   }
   void dfs2(int v,int p,int& k){
      in[v]=k++;
      for(auto& to:g[v])if(to!=p){
         hs[to]=(g[v][0]==to?hs[v]:to);
         dfs2(to,v,k);
      }
      out[v]=k;
   }
   HLD(int _n):g(_n),sz(_n),in(_n),out(_n),hs(_n),par(_n){}
   void add_edge(int u,int v){
      g[u].emplace_back(v); g[v].emplace_back(u);
   }
   void run(){dfs(0,-1); int k=0; dfs2(0,-1,k);}
   int lca(int u,int v){
      for(;;v=par[hs[v]]){
         if(in[u]>in[v])swap(u,v);
         if(hs[u]==hs[v])return u;
      }
   }
   vector<P> get(int u,int v,bool es=0){
      vector<P> res;
      for(;;v=par[hs[v]]){
         if(in[u]>in[v])swap(u,v);
         if(hs[u]==hs[v])break;
         res.emplace_back(in[hs[v]],in[v]+1);
      }
      res.emplace_back(in[u]+es,in[v]+1);
      return res;
   }
};

template<typename T>struct BIT{
   int n; T all=0; vector<T> val;
   BIT(int _n):n(_n),val(_n+10){}
   void clear(){val.assign(n+10,0); all=T();}
   void add(int i,T x){
      for(i++;i<=n;i+=(i&-i))val[i]^=x;
      all^=x;
   }
   T sum(int i){
      T res=0;
      for(i++;i;i-=(i&-i))res^=val[i];
      return res;
   }
};

int main(){
   int n,q;
   cin>>n>>q;

   vector<int> a(n);
   HLD hld(n);
   rep(i,0,n)cin>>a[i];
   rep(_,0,n-1){
      int x,y;
      cin>>x>>y;
      x--; y--;
      hld.add_edge(x,y);
   }
   
   hld.run();
   BIT<int> bit(n);
   rep(i,0,n)bit.add(hld.in[i],a[i]);

   while(q--){
      int t,x,y;
      cin>>t>>x>>y;
      if(t==1){
         x--;
         bit.add(hld.in[x],y);
      }
      else{
         x--;
         int res=bit.sum(hld.out[x]-1)^bit.sum(hld.in[x]-1);
         cout<<res<<'\n'; 
      }
   }
   return 0;
}