#include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 using namespace std;

 int rd(){int z=,mk=;  char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')mk=-;  ch=getchar();}

     while(ch>=''&&ch<=''){z=(z<<)+(z<<)+ch-'';  ch=getchar();}

     return z*mk;

 }

 struct edg{int nxt,y;}e[];  int lk[],ltp=;

 inline void ist(int x,int y){  e[++ltp].nxt=lk[x],lk[x]=ltp,e[ltp].y=y;}

 int n,m;

 int fth[],chd[][],tpf[];

 int acst[][],dp[],dod[],lod[],rod[],cod=;

 int v[],vt[];

 void dfs(int x){

     dod[lod[x]=++cod]=x;

     for(int i=lk[x];i;i=e[i].nxt)if(e[i].y!=acst[x][])

         acst[e[i].y][]=fth[e[i].y]=x,dp[e[i].y]=dp[x]+,dfs(e[i].y);

     rod[x]=cod;

 }

 int lca(int x,int y){

     if(dp[x]<dp[y])  swap(x,y);

     for(int i=,j=dp[x]-dp[y];i<=;++i)if((<<i)&j)  x=acst[x][i];

     for(int i=;i>=;--i)if(acst[x][i]!=acst[y][i])

         x=acst[x][i],y=acst[y][i];

     if(x==y)  return x;

     return acst[x][];

 }

 void pshd(int x){

     v[x<<]+=vt[x],v[x<<|]+=vt[x];

     vt[x<<]+=vt[x],vt[x<<|]+=vt[x];

     vt[x]=;

 }

 void gtsgmttr(int x,int l,int r){

     if(l==r){  v[x]=dp[dod[l]]+;  return ;}

     int md=(l+r)>>;

     gtsgmttr(x<<,l,md),gtsgmttr(x<<|,md+,r);

     v[x]=max(v[x<<],v[x<<|]);

 }

 void mdf(int x,int l,int r,int ql,int qr,int z){

     if(l==ql && r==qr){  v[x]+=z,vt[x]+=z;  return ;}

     int md=(l+r)>>;  pshd(x);

     if(ql<=md && qr>md)  mdf(x<<,l,md,ql,md,z),mdf(x<<|,md+,r,md+,qr,z);

     else if(qr<=md)  mdf(x<<,l,md,ql,qr,z);

     else  mdf(x<<|,md+,r,ql,qr,z);

     v[x]=max(v[x<<],v[x<<|]);

 }

 int qur(int x,int l,int r,int ql,int qr){

     if(l==ql && r==qr)  return v[x];

     int md=(l+r)>>;  pshd(x);

     if(ql<=md && qr>md)  return max(qur(x<<,l,md,ql,md),qur(x<<|,md+,r,md+,qr));

     else if(qr<=md)  return qur(x<<,l,md,ql,qr);

     else  return qur(x<<|,md+,r,ql,qr);

 }

 inline bool isrt(int x){  return (chd[fth[x]][]!=x)&(chd[fth[x]][]!=x);}

 void pshu(int x){  tpf[x]=chd[x][] ? tpf[chd[x][]] : x;}

 void rtt(int x){

     int y=fth[x],z=fth[fth[x]],l,r;

     r=(chd[y][]==x);  l=r^;

     if(!isrt(y))  chd[z][chd[z][]==y]=x;

     fth[x]=z,fth[y]=x,fth[chd[x][r]]=y;

     chd[y][l]=chd[x][r],chd[x][r]=y;

     pshu(y),pshu(x);

 }

 void sply(int x){

     while(!isrt(x)){

         int y=fth[x],z=fth[fth[x]];

         if(!isrt(y))  rtt((chd[y][]==x)^(chd[z][]==y) ? x : y);

         rtt(x);

     }

 }

 void accs(int x){

     int lst=;

     while(x){

         sply(x);

         if(chd[x][])  mdf(,,n,lod[tpf[chd[x][]]],rod[tpf[chd[x][]]],);

         if(lst)  mdf(,,n,lod[tpf[lst]],rod[tpf[lst]],-);

         chd[x][]=lst,x=fth[lst=x];

     }

 }

 int gtnm(int x){

     int bwl=;

     while(x){

         sply(x);

         x=fth[x],++bwl;

     }

     return bwl;

 }

 int cclt(int x,int y){

     int z=lca(x,y);

     return gtnm(x)+gtnm(y)-(gtnm(z)<<)+;

 }

 int main(){//freopen("ddd.in","r",stdin);

     int l,r,mk;

     cin>>n>>m;

     for(int i=;i<n;++i)  l=rd(),r=rd(),ist(l,r),ist(r,l);

     dfs(),gtsgmttr(,,n);

     for(int i=;i<=n;++i)  tpf[i]=i;

     for(int i=;i<=n;++i)for(int j=;(<<j)<=dp[i];++j)

         acst[i][j]=acst[acst[i][j-]][j-];

     while(m--){

         mk=rd();

         if(mk==)  accs(rd());

         else if(mk==)  printf("%d\n",cclt(rd(),rd()));

         else  l=rd(),printf("%d\n",qur(,,n,lod[l],rod[l]));

     }

     return ;

 }