#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#define MN 200000
#define MD 17
#define N 131072
using namespace std;
inline int read()
{int x=0;char ch=getchar();while(ch<'0'||ch>'9') ch=getchar();while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();return x;
}int n,m,head[MN+5],nl[MN+5],nr[MN+5],dn,cnt,T[N*2+5],q[MN+5],q1[MN+5],q2[MN+5];
int top1,top2,fa[MD+1][MN+5],num,l[MN+5],tot=1,Ans[MN+5],dep[MN+5];
struct edge{int to,next,w;}e[MN*2+5];
struct data{int kind,x,y,z,w,ad;}s[MN+5];inline void ins(int f,int t)
{e[++cnt]=(edge){t,head[f]};head[f]=cnt;e[++cnt]=(edge){f,head[t]};head[t]=cnt;
}void Pre(int x,int f)
{nl[x]=++dn;fa[0][x]=f;for(int i=head[x];i;i=e[i].next)if(e[i].to!=f) dep[e[i].to]=dep[x]+1,Pre(e[i].to,x);nr[x]=dn;
}int lca(int x,int y)
{if(dep[x]<dep[y]) swap(x,y);for(int k=dep[x]-dep[y],j=0;k;k>>=1,++j)if(k&1) x=fa[j][x];if(x==y) return x;for(int i=MD;~i;--i)if(fa[i][x]!=fa[i][y])x=fa[i][x],y=fa[i][y];return fa[0][x];
}void Modify(int x,int ad)
{T[x+=N]+=ad;for(x>>=1;x;x>>=1) T[x]=T[x<<1]+T[x<<1|1];
}int Query(int l,int r)
{int sum=0;for(l+=N-1,r+=N+1;l^r^1;l>>=1,r>>=1){if(~l&1) sum+=T[l+1];if( r&1) sum+=T[r-1];}return sum;
}void Solve(int l,int r,int lt,int rt)
{if(l>r) return;if(lt==rt){for(int i=l;i<=r;++i)if(s[q[i]].kind) Ans[q[i]]=lt;return;}int mid=lt+rt>>1,sum=0;top1=top2=0;for(int i=l;i<=r;++i)if(s[q[i]].kind){if(Query(nl[s[q[i]].x],nr[s[q[i]].x])==sum) q1[++top1]=q[i];else q2[++top2]=q[i];}else{if(s[q[i]].w>mid){sum+=s[q[i]].ad;Modify(nl[s[q[i]].x],s[q[i]].ad);Modify(nl[s[q[i]].y],s[q[i]].ad);Modify(nl[s[q[i]].z],-s[q[i]].ad);if(s[q[i]].z!=1) Modify(nl[fa[0][s[q[i]].z]],-s[q[i]].ad);q2[++top2]=q[i];}else q1[++top1]=q[i];}for(int i=l;i<=r;++i)if(s[q[i]].kind==0&&s[q[i]].w>mid){Modify(nl[s[q[i]].x],-s[q[i]].ad);Modify(nl[s[q[i]].y],-s[q[i]].ad);Modify(nl[s[q[i]].z],s[q[i]].ad);if(s[q[i]].z!=1) Modify(nl[fa[0][s[q[i]].z]],s[q[i]].ad);}for(int i=1;i<=top1;++i) q[l+i-1]=q1[i];for(int i=1;i<=top2;++i) q[l+top1+i-1]=q2[i];int pre=top1;Solve(l,l+top1-1,lt,mid);Solve(l+pre,r,mid+1,rt);
}int main()
{n=read();m=read();for(int i=1;i<n;++i) ins(read(),read());Pre(1,0);l[++num]=-1;for(int i=1;i<=MD;++i)for(int j=1;j<=n;++j)fa[i][j]=fa[i-1][fa[i-1][j]];for(int i=1;i<=m;++i){int op=read(); q[i]=i;if(op==0) s[i].x=read(),s[i].y=read(),s[i].z=lca(s[i].x,s[i].y),s[i].w=l[++num]=read(),s[i].ad=1;if(op==1) s[i]=s[read()],s[i].ad=-1;if(op==2) s[i].kind=1,s[i].x=read();}sort(l+1,l+num+1);for(int i=2;i<=num;++i) if(l[i]!=l[i-1]) l[++tot]=l[i];for(int i=1;i<=m;++i) if(!s[i].kind) s[i].w=lower_bound(l+1,l+tot+1,s[i].w)-l;Solve(1,m,1,tot);for(int i=1;i<=m;++i)if(s[i].kind) printf("%d\n",l[Ans[i]]);return 0;
}