#include<algorithm>

 #include<iostream>

 #include<cstdlib>

 #include<cstring>

 #include<cstdio>

 #include<cmath>

 #include<queue>

 using namespace std;

 typedef long long LL;

 #define N 200010

 struct data

 {

     int l,r;

 }q[N];

 struct edge

 {

     int s,to,next;

 }e[N<<];

 int head[N<<];

 int cnt;

 int dep[N],siz[N],son[N],top[N],pos[N];

 int fa[N][],val[N<<];

 bool vis[N];

 int n,m;

 int ans,res,num;

 int askd;

 struct cmp

 {

     bool operator() (int a,int b)

     {

         return val[a]<val[b];

     }

 };

 priority_queue<int,vector<int>,cmp> Q[N<<];

 bool cmp(data a,data b)

 {

     return a.l<b.l;

 }

 void link(int x,int y)

 {

     e[++cnt]=(edge){x,y,head[x]};

     head[x]=cnt;

 }

 void dfs(int x)

 {

     siz[x]=;

     son[x]=;

     for (int i=head[x];i;i=e[i].next)

     {

         int t=e[i].to;

         if (t!=fa[x][])

         {

             dep[t]=dep[x]+;

             fa[t][]=x;

             dfs(t);

             siz[x]+=siz[t];

             if (siz[t]>siz[son[x]])

                 son[x]=t;

         }

     }

 }

 void dfs2(int x,int cha)

 {

     pos[x]=++res;

     top[x]=cha;

     if (son[x])

         dfs2(son[x],cha);

     for (int i=head[x];i;i=e[i].next)

     {

         int t=e[i].to;

         if (t!=fa[x][] && t!=son[x])

             dfs2(t,t);

     }

 }

 void build_lca()

 {

     for (int j=;j<=;j++)

         for (int i=;i<=n;i++)

             if (fa[i][j-])

                 fa[i][j]=fa[fa[i][j-]][j-];

 }

 int lca(int x,int y)

 {

     if (dep[x]<dep[y])

         swap(x,y);

     int t=dep[x]-dep[y];

     for (int i=;i>=;i--)

         if (t & (<<i))

             x=fa[x][i];

     if (x==y)

         return x;

     for (int i=;i>=;i--)

         if (fa[x][i]!=fa[y][i])

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

     return fa[x][];

 }

 void add(int nowl,int nowr,int now,int l,int r,int d)

 {

     if (l<=nowl && nowr<=r)

     {

         Q[now].push(d);

         return ;

     }

     int mid=(nowl+nowr)>>;

     if (l<=mid)

         add(nowl,mid,now<<,l,r,d);

     if (r>=mid+)

         add(mid+,nowr,now<<|,l,r,d);

 }

 void query(int nowl,int nowr,int now,int d)

 {

     while (!Q[now].empty())

     {

         int k=Q[now].top();

         if (vis[k])

             Q[now].pop();

         else

         {

             num=max(num,val[k]);

             break;

         }

     }

     if (nowl==nowr)

         return ;

     int mid=(nowl+nowr)>>;

     if (d<=mid)

         query(nowl,mid,now<<,d);

     else

         query(mid+,nowr,now<<|,d);

 }

 int main()

 {

     scanf("%d%d",&n,&m);

     int x,y;

     for (int i=;i<n;i++)

     {

         scanf("%d%d",&x,&y);

         link(x,y);

         link(y,x);

     }

     dep[]=;

     dfs();

     dfs2(,);

     build_lca();

     for (int i=;i<=m;i++)

     {

         scanf("%d",&askd);

         if (askd==)

         {

             scanf("%d%d%d",&x,&y,&val[i]);

             int w=,z=lca(x,y);

             while (dep[top[x]]>dep[z])

             {

                 q[++w]=(data){pos[top[x]],pos[x]};

                 x=fa[top[x]][];

             }

             while (dep[top[y]]>dep[z])

             {

                 q[++w]=(data){pos[top[y]],pos[y]};

                 y=fa[top[y]][];

             }

             if (x!=z)

                 q[++w]=(data){pos[z],pos[x]};

             else if (y!=z)

                 q[++w]=(data){pos[z],pos[y]};

             else

                 q[++w]=(data){pos[z],pos[z]};

             q[++w]=(data){n+,n+};

             sort(q+,q+w+,cmp);

             for (int j=;j<=w;j++)

                 if (q[j-].r<q[j].l-)

                     add(,n,,q[j-].r+,q[j].l-,i);

         }

         else if (askd==)

         {

             scanf("%d",&x);

             vis[x]=;

         }

         else

         {

             scanf("%d",&x);

             num=-;

             query(,n,,pos[x]);

             printf("%d\n",num);

         }

     }

     return ;

 }