#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
bool Mbg;
using namespace std;
#define vec vector
#define pb push_back
#define eb emplace_back
#define siz(vec) ((int)(vec).size())
#define all(vec) (vec).begin(),(vec).end()
template<class T>
void operator +=(vec<T> &a,T b){a.push_back(b);}
template<class T>
void operator --(vec<T> &a){a.pop_back();}
#define pii pair<int,int>
#define x first
#define y second
#define mp make_pair
#define exc(exp) if(exp)continue;
#define stop(exp) if(exp)break;
#define ret(exp) if(exp)return;
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define debl(var) cerr<<#var<<'='<<(var)<<";\n"
#define ins insert
#define era erase
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define inf (long long)(1e18)
template<class T>
bool Min(T &x,T y){return x>y?x=y,1:0;}
template<class T>
bool Max(T &x,T y){return x<y?x=y,1:0;}
const int mod=998244353;
void Add(int &x,int y){x=x+y<mod?x+y:x+y-mod;}
void Dec(int &x,int y){x=x>=y?x-y:x-y+mod;}
int fpm(int x,int y){
    int ans=1;for(;y;y>>=1,x=1ll*x*x%mod)if(y&1)ans=1ll*x*ans%mod;return ans;
}

int n,q;
vec<int> g[100010];

int fa[100010],hvy[100010],dep[100010],siz[100010],tim,dfn[100010],top[100010];

void dfs(int u,int f){
    siz[u]=1;
    dep[u]=dep[fa[u]=f]+1;
    for(auto v:g[u]){
        exc(v==f);
        dfs(v,u);
        siz[u]+=siz[v];
    }
}
void dfs2(int u,int fa){
    dfn[u]=++tim;
    if(hvy[u]){
        top[hvy[u]]=top[u];
        dfs(hvy[u],u);
    }
    for(auto v:g[u]){
        exc(v==fa||v==hvy[u]);
        top[v]=v;
        dfs2(v,u);
    }
}

int a[100010];
void add(int l,int r,int x){
    for(;l<=r;l++){
        a[l]+=x;
    }
}
int qry(int l,int r){
    int x=0;
    for(;l<=r;l++){
        x^=a[l];
    }
    return x;
}
void work(){
    cin>>n>>q;
    for(int i=1,u,v;i<n;i++){
        cin>>u>>v;
        g[u]+=v,g[v]+=u;
    }
    dfs(1,0);
    top[1]=1;
    dfs2(1,0);
    for(int i=1;i<=n;i++){
        add(dfn[i],dfn[i],i);
    }

    while(q--){
        char op;
        int u,v,x;

        cin>>op>>u>>v;
        if(op=='?'){
            
            int ans=0;
            
            while(top[u]!=top[v]){
                if(dep[top[u]]<dep[top[v]])swap(u,v);
                ans^=qry(dfn[top[u]],dfn[u]);
                u=fa[top[u]];
            }

            if(dep[u]>dep[v])swap(u,v);
            ans^=qry(dfn[u],dfn[v]);
            cout<<ans<<'\n';

        }else{
            cin>>x;

            while(top[u]!=top[v]){
                if(dep[top[u]]<dep[top[v]])swap(u,v);
                add(dfn[top[u]],dfn[u],x);
                u=fa[top[u]];
            }
            if(dep[u]>dep[v])swap(u,v);
            add(dfn[u],dfn[v],x);
        }
    }
}
bool Med;
signed main(){
    ios::sync_with_stdio(0),
    cin.tie(0),cout.tie(0);
    int T=1;while(T--)work();
    // cerr<<"Time: "<<clock()<<" ms;\n";
    // cerr<<"Memory: "<<abs(&Med-&Mbg)/1024.0/1024.0<<" MiB.\n";
}
/*
- CONTINUE, NON-STOPPING, FOR THE FAITH
- START TYPING IF YOU DON'T KNOW WHAT TO DO
- STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
*/