#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define all(s) (s).begin(),(s).end()
//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
//#define rep(i, n) rep2(i, 0, n)
#define PB push_back 
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
//#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define NP next_permutation
//const ll mod = 1000000009;
//const ll mod = 998244353;
const ll mod = 1000000007;
const ll inf = 9100000000000000000ll;
const ld eps = ld(0.0000000000001);
static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll a){ll res=0;while(a){res+=a%2;a/=2;}return res;}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};
 
void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
struct SegTree{
  vector<ll> node;
  ll N;
  SegTree(){
  }
  SegTree(ll n){
    N=1;
    while(N<n) N*=2;
    node.resize(N*2-1);
    for(int i=0;i<N*2-1;i++) node[i]=0;
  }
  SegTree(vector<ll> n){
    N=1;
    while(N<n.size()) N*=2;
    node.resize(N*2-1);
    for(int i=0;i<N-1;i++) node[i]=0;
    for(int i=N-1;i<N+n.size();i++) node[i]=n[i-(N-1)];
  }
  void build(){
    for(int i=N-2;i>=0;i--){
      node[i]=(node[i*2+1]^node[i*2+2]);
    }
  }
  void add(ll x,ll y){
    node[x+N-1]^=y;
    x=x+N-1;
    while(x){
      node[(x-1)/2]=(node[((x-1)/2)*2+1]^node[((x-1)/2)*2+2]);
      x=(x-1)/2;
    }
  }
  ll sub_query(ll a,ll b,ll k,ll l,ll r){
    if(r<=a||b<=l) return 0;
    if(a<=l&&r<=b){
      return node[k];
    }
    else{
      return sub_query(a,b,k*2+1,l,(l+r)/2)^sub_query(a,b,k*2+2,(l+r)/2,r);
    }
  }
  ll query(ll a,ll b){
    return sub_query(a,b,0,0,N);
  }
};
struct HeavyLightDecomposition{
  ll n;
  vector<ll> ind;//新しい中で何番
  vector<ll> r;//親
  vector<ll> next;//HL分解の中でそれの列の上の元のindex
  vector<ll> si;//部分木のサイズ
  SegTree seg;//セグ木
  void dfs(vector<vector<ll>> &g,ll p,ll q){
    si[p]++;
    for(auto e:g[p]){
      if(e==q) continue;
      dfs(g,e,p);
      si[p]+=si[e];
    }
  }
  void dfs2(vector<vector<ll>> &g,ll p,ll q,ll &t){
    ind[p]=t;
    t++;
    vector<P> ne;
    for(auto e:g[p]){
      if(e==q) continue;
      ne.pb({si[e],e});
    }
    sor(ne);
    rever(ne);
    bool x=true;
    for(auto e:ne){
      r[e.se]=p;
      if(x){
        x=false;
        next[e.se]=next[p];
      }
      else{
        next[e.se]=e.se;
      }
      dfs2(g,e.se,p,t);
    }
  }
  HeavyLightDecomposition(vector<vector<ll>> &g,vector<ll> a){
    n=g.size();
    ind.resize(n);
    r.resize(n);
    next.resize(n);
    si.resize(n);
    dfs(g,0,-1);
    ll u=0;
    dfs2(g,0,-1,u);
    SegTree S(n);
    for(int i=0;i<n;i++){
      S.add(ind[i],a[i]);
    }
    seg=S;
  }
  ll lca(ll a,ll b){
    while(1){
      if(ind[a]>ind[b]){
        swap(a,b);
      }
      if(next[a]==next[b]){
        return a;
      }
      b=r[next[b]];
    }
  }
  void add(ll a,ll b){
    seg.add(ind[a],b);
  }
  ll query(ll a){
    return seg.query(ind[a],ind[a]+si[a]);
  }
};
int main() {
  cincout();
  ll n,q;
  cin>>n>>q;
  vector<ll> k(n);
  vcin(k);
  vector<vector<ll>> u(n);
  for(int i=1;i<n;i++){
    ll a;
    cin>>a;
    ll s;
    cin>>s;
    s--;
    a--;
    u[a].pb(s);
    u[s].pb(a);
  }
  HeavyLightDecomposition HL(u,k);
  while(q--){
    ll t;
    cin>>t;
    //cout<<"K"<<" "<<t<<endl;
    if(t==1){
      ll p,x;
      cin>>p>>x;
      p--;
      HL.add(p,x);
    }
    else{
      ll x;
      cin>>x;
      ll y;
      cin>>y;
      x--;
      cout<<HL.query(x)<<endl;
    }
  }
}