/kel

#include <bits/stdc++.h>

#define ll long long
#define ull unsigned long long
#define i128 __int128
#define endl '\n'
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define vei vector<int>
#define pq priority_queue
#define yes puts("yes")
#define no puts("no")
#define Yes puts("Yes")
#define No puts("No")
#define YES puts("YES")
#define NO puts("NO")
#define In(x) freopen(x".in","r",stdin)
#define Out(x) freopen(x".out","w",stdout)
#define File(x) (In(x),Out(x))
using namespace std;
const int N=3e6,L=30;
int n,m,tot,fa[N],a[N];
int nxt[N*L*2][2],tag[N],w[N],x[N];
vei ve[N];
void dfs(int u,int f){
	fa[u]=f;
	for(auto v:ve[u]){
		if(v==f) continue;
		dfs(v,u);
	}
}
void maintain(int u){
	w[u]=x[u]=0;
	if(nxt[u][0]){
		w[u]+=w[nxt[u][0]];
		x[u]^=x[nxt[u][0]]<<1;
	}
	if(nxt[u][1]){
		w[u]+=w[nxt[u][1]];
		x[u]^=(x[nxt[u][1]]<<1)|(w[nxt[u][1]]&1);
	}
}
void insert(int &u,int x,int dp){
	if(!u) u=++tot;
	if(dp==L) w[u]++;
	else insert(nxt[u][x&1],x>>1,dp+1),maintain(u);
}
void erase(int u,int x,int dp){
	if(dp==L) w[u]--;
	else erase(nxt[u][x&1],x>>1,dp+1),maintain(u);
}
void add(int u){
	if(u==0) return;
	swap(nxt[u][0],nxt[u][1]);
	add(nxt[u][0]);
	maintain(u);
}
int get(int u){
	if(fa[u]) return a[u]+tag[fa[u]];
	else return a[u];
}
void solve(){
	cin>>n>>m;
	tot=n;
	for(int i=1;i<n;i++){
		int u,v;
		cin>>u>>v;
		ve[u].pb(v);
		ve[v].pb(u);
	}
	dfs(1,0);
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int u=2;u<=n;u++) insert(fa[u],get(u),0);
	for(int i=1;i<=m;i++){
		int op,u;
		cin>>op>>u;
		if(op==1){
			add(u);
			if(fa[fa[u]]) erase(fa[fa[u]],get(fa[u]),0);
			if(fa[u]) a[fa[u]]++;
			tag[u]++;
			if(fa[fa[u]]) insert(fa[fa[u]],get(fa[u]),0);
		}
		else if(op==2){
			int v;
			cin>>v;
			if(fa[u]) erase(fa[u],get(u),0);
			a[u]-=v;
			if(fa[u]) insert(fa[u],get(u),0);
		}
		else{
			if(fa[u]) cout<<(get(fa[u])^x[u])<<endl;
			else cout<<x[u]<<endl;
		}
	}
}
signed main(){
	ios::sync_with_stdio(0);
	signed T=1;
//	cin>>T;
	while(T--) solve();
	return 0;
}