#include<bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint=modint998244353; //1000000007;
using ll=long long;
using pp=pair<int,int>;
#define sr string 
#define vc vector
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define pque priority_queue
#define bpc(a) __builtin_popcount(a)
int op(int a,int b){return a^b;}
int e(){return 0;}
int main(){
  int n,q;cin>>n>>q;
  vc v(n,vc<int>(0)); 
  vc<int>c(n); rep(i,n)cin>>c[i];
  rep(i,n-1){
    int a,b;cin>>a>>b;a--;b--;
    v[a].pb(b);v[b].pb(a);
  }
  vc<int>l(n),r(n);
  int x=0;
  auto f=[&](auto f,int a,int p)->int{
    int res=1;
    l[a]=x++;
    for(auto au:v[a])if(au!=p)res+=f(f,au,a);
    r[a]=l[a]+res;
    return res;
  };
  f(f,0,-1);
  segtree<int,op,e>sg(n);
  rep(i,n)sg.set(l[i],c[i]);
  rep(i,q){
    int t,a,b;cin>>t>>a>>b; a--;
    if(t==1)sg.set(l[a],sg.get(l[a])^b);
    else cout<<sg.prod(l[a],r[a])<<"\n";
  }
}