好神的题…
#include<bits/stdc++.h>
#define rep(i,k,n) for(int i=k;i<=(n);i++)
using namespace std;
const int maxn = 1000007;
struct E {
int to, next, num;
E(int to = 0, int next = 0, int num = 0): to(to), next(next), num(num) {}
} edge[2 * maxn];
int head[maxn], id[maxn], tot = 1, n, m, da[maxn], p[maxn], dep[maxn],fa[maxn],first[maxn],cc[maxn],pp[maxn];
int bin[21];
void add(int x, int y, int num) {
edge[++tot] = E(y, head[x], num);
head[x] = tot;
edge[++tot] = E(x, head[y], num);
head[y] = tot;
}
inline int find(int x) {
return p[x] == x ? x : p[x] = find(p[x]);
}
void dfs(int x){
// rep(i,1,20)fa[x][i]=fa[fa[x][i-1]][i-1];
dep[x]=dep[fa[x]]+1;
for(int i=head[x];i;i=edge[i].next){int v=edge[i].to;
if(v!=fa[x]){
fa[v]=x;
id[v]=edge[i].num;
dfs(v);
}
}
}
/*int lca(int x,int y){
if(dep[x]<dep[y])swap(x,y);
int dd=dep[x]-dep[y];
for(int i=20;i>=0 && dd;i--)if(bin[i]<=dd){dd-=bin[i];x=fa[x][i];}
if(x==y)return x;
for(int i=20;i>=0;i--){
if(fa[x][i]!=fa[y][i])x=fa[x][i],y=fa[y][i];
}return fa[x][0]; //染的是边啊!!所以不能染lca
}*/
void color(int x,int y,int tt){
// int ll=lca(x,y);
x=find(x),y=find(y);
while(x!=y){
if(dep[x]<dep[y])swap(x,y);
if(first[x]!=m+1)x=p[x];
else first[x]=tt,p[x]=p[fa[x]],x=p[x]; //维护节点向上的第一个白点,类似bzoj2054;
}
// x=ll;
// if(first[x]==m+1)first[x]=tt,p[x]=p[fa[x][0]],x=p[x];
}
int main() {//freopen("in.in","r",stdin);
bin[0]=1;rep(i,1,20)bin[i]=bin[i-1]<<1;
int x, y, op;
scanf("%d%d", &n, &m);
rep(i, 1, n){p[i] = i;first[i]=m+1;}
rep(i, 1, n - 1) {
scanf("%d%d", &x, &y);
add(x, y, i);
}
dfs(1);memset(da,-1,sizeof(da));
rep(i, 1, m) {
scanf("%d", &op);
if(op == 2) {
scanf("%d%d", &x, &y);
color(x, y, i);
} else scanf("%d",&da[i]);
}
rep(i,1,n)cc[first[i]]++;
rep(i,2,m+1)cc[i]+=cc[i-1];
rep(i,1,n)pp[cc[first[i]]--]=i;
rep(i,1,n)p[i]=i; //维护节点向上的第一个黑点;
int all=n,u;
for(int i=m+1;i>=1;i--){
if(da[i]!=-1){da[i]=id[find(da[i])];}
else for(;all && first[u=pp[all]]==i;all--){
p[u]=p[fa[u]];
}
}
rep(i,1,m)if(da[i]!=-1)printf("%d\n",da[i]);
}