#include<bits/stdc++.h>
using namespace std;
inline int read(){
	int x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
typedef unsigned u256 __attribute((vector_size(32)));
const int N=100000>>3;
int n,m,q,b[100005],siz[100005],son[100005],top[100005],fa[100005];
int hx[100005],line[100005],dep[100005],head[100005],tot,dfn;
struct Edge{
	int to,nxt;
}edge[200005];
void add(int u,int v){
	tot++;
	edge[tot].to=v; edge[tot].nxt=head[u];
	head[u]=tot;
}
void dfs1(int x,int f,int d){
	dep[x]=d,fa[x]=f,siz[x]=1;
	for(int i=head[x];i;i=edge[i].nxt){
		int tmp=edge[i].to;
		if(tmp==f) continue;
		dfs1(tmp,x,d+1); siz[x]+=siz[tmp];
		if(siz[tmp]>siz[son[x]]) son[x]=tmp; 
	}
}
void dfs2(int x,int link){
	top[x]=link; line[++dfn]=x,hx[x]=dfn;
	if(son[x]==0) return;
	dfs2(son[x],link);
	for(int i=head[x];i;i=edge[i].nxt){
		int tmp=edge[i].to;
		if(tmp==fa[x] || tmp==son[x]) continue;
		dfs2(tmp,tmp);
	}
}
u256 a[N],ans,tmp;
inline void add(int l,int r,int x){
	u256 xx=u256{x,x,x,x,x,x,x,x};
	if((l>>3)==(r>>3)){
		for(int i=l&7;i<=(r&7);i++){
			a[l>>3][i]+=x;
		}
	}else{
		for(int i=l&7;i<=7;i++){
			a[l>>3][i]+=x;
		}
		for(int i=0;i<=(r&7);i++){
			a[r>>3][i]+=x;
		}
		for(int i=(l>>3)+1;i<=(r>>3)-1;i++){
			a[i]+=xx;
		}
	}
}
inline int query(int l,int r){
	u256 ans=u256{0,0,0,0,0,0,0,0};
	int res=0;
	if((l>>3)==(r>>3)){
		for(int i=l&7;i<=(r&7);i++){
			res^=a[l>>3][i];
		}
	}else{
		for(int i=l&7;i<=7;i++){
			res^=a[l>>3][i];
		}
		for(int i=0;i<=(r&7);i++){
			res^=a[r>>3][i];
		}
		for(int i=(l>>3)+1;i<=(r>>3)-1;i++){
			ans^=a[i];
		}
		for(int i=0;i<=7;i++){
			res^=ans[i];
		}
	}
	return res;
}
void Update(int x,int y,int num){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]){
			int t=x; x=y; y=t;
		}
		add(hx[top[x]],hx[x],num);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]){
		int t=x; x=y; y=t;
	}
	add(hx[x],hx[y],num);
}
int Query(int x,int y){
	int ans=0;
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]){
			int t=x; x=y; y=t;
		}
		ans^=query(hx[top[x]],hx[x]);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y]){
		int t=x; x=y; y=t;
	}
	ans^=query(hx[x],hx[y]); 
	return ans;
}
int main(){
		#ifdef LOCAL
			assert(freopen("input.txt","r",stdin));
			assert(freopen("output.txt","w",stdout));
		#endif
	n=read(),q=read();
	for(int i=1;i<n;i++){
		int a=read(), b=read();
		add(a, b); add(b, a);
	}
	// cerr<<"ok"<<endl;
	dfs1(1,0,0);
	// cerr<<"ok"<<endl;
	dfs2(1,1);
	// cerr<<"ok"<<endl;
	for(int i=1;i<=n;i++) a[i>>3][i&7]=line[i];
	while(q--){
		char s[5]; scanf("%s", s);
		if(s[0]=='?'){
			int x=read(), y=read();
			printf("%d\n", Query(x, y));
		}else{
			int x=read(), y=read(), v=read();
			Update(x,y,v);
		}
	}
}