#include <cstdio>

#include <cstring>

#include <cmath>

#include <string>

#include <iostream>

#include <algorithm>

#include <queue>

#include <set>

#include <map>

#include <sstream>

using namespace std;

typedef long long ll;

#define pb push_back

#define rep(i, n) for(int i=0; i<(n); ++i)

#define for1(i,a,n) for(int i=(a);i<=(n);++i)

#define for2(i,a,n) for(int i=(a);i<(n);++i)

#define for3(i,a,n) for(int i=(a);i>=(n);--i)

#define for4(i,a,n) for(int i=(a);i>(n);--i)

#define CC(i,a) memset(i,a,sizeof(i))

#define read(a) a=getint()

#define print(a) printf("%d", a)

#define dbg(x) cout << (#x) << " = " << (x) << endl

#define error(x) (!(x)?puts("error"):0)

#define rdm(x, i) for(int i=ihead[x]; i; i=e[i].next)

inline int getint() { static int r, k; r=0,k=1; static char c; c=getchar(); for(; c<'0'||c>'9'; c=getchar()) if(c=='-') k=-1; for(; c>='0'&&c<='9'; c=getchar()) r=r*10+c-'0'; return k*r; }

const int N=1e6+10;

int lca[N], fa[N], dep[N], id[N], n, del[N];

struct Un {

	int f[N];

	void init() { for1(i, 1, n) f[i]=i; }

	int find(int x) { return x==f[x]?x:f[x]=find(f[x]); }

	void U(int x, int y) { x=find(x); y=find(y); if(dep[x]<dep[y]) swap(x, y); f[x]=y; }

};

struct Gr {

	int ihead[N], cnt;

	struct dat { int next, from, to, id; }e[N<<1];

	void add(int u, int v, int id) {

		e[++cnt].next=ihead[u]; ihead[u]=cnt; e[cnt].from=u; e[cnt].to=v; e[cnt].id=id;

		e[++cnt].next=ihead[v]; ihead[v]=cnt; e[cnt].from=v; e[cnt].to=u; e[cnt].id=id;

	}

	void add1(int u, int v) {

		e[++cnt].next=ihead[u]; ihead[u]=cnt; e[cnt].to=v;

	}

	void tarjan(int x, Gr &g) {

		static bool vis[N];

		static Un p;

		p.f[x]=x;

		rdm(x, i) if(e[i].to!=fa[x]) { dep[e[i].to]=dep[x]+1; fa[e[i].to]=x; id[e[i].to]=i; tarjan(e[i].to, g); p.f[e[i].to]=x; }

		vis[x]=1;

		for(int i=g.ihead[x]; i; i=g.e[i].next) if(vis[g.e[i].to]) lca[g.e[i].id]=p.find(g.e[i].to);

	}

}G, ask, g;

Un f, temp;

void split(int u, int v, int goal, int now) {

	for(u=temp.find(u); dep[u]>dep[goal]; del[u]=1, temp.U(u, fa[u]), g.add1(now, id[u]), u=temp.find(fa[u]));

	for(v=temp.find(v); dep[v]>dep[goal]; del[v]=1, temp.U(v, fa[v]), g.add1(now, id[v]), v=temp.find(fa[v]));

}

void link(int u, int v, int goal, int now) {

	for(int i=g.ihead[now]; i; i=g.e[i].next) f.U(G.e[g.e[i].to].from, G.e[g.e[i].to].to);

}

struct Q { int flag, u, v; }q[N];

int m;

int main() {

	read(n); read(m);

	for1(i, 1, n-1) G.add(getint(), getint(), i);

	for1(i, 1, m) {

		read(q[i].flag); read(q[i].v);

		if(q[i].flag==2) {

			read(q[i].u);

			ask.add(q[i].u, q[i].v, i);

		}

	}

	G.tarjan(1, ask);

	temp.init();

	f.init();

	for1(i, 1, m) if(q[i].flag==2) {

		split(q[i].u, q[i].v, lca[i], i);

	}

	// for1(i, 1, m) if(q[i].flag==2) {

	// 	printf("g[%d]:", i);

	// 	for(int j=g.ihead[i]; j; j=g.e[j].next) printf(" (%d<->%d), ", G.e[g.e[j].to].from, G.e[g.e[j].to].to); puts("");

	// }

	for1(i, 2, n) if(!del[i]) f.U(i, fa[i]);

	static int out[N], num=0;

	for3(i, m, 1) {

		if(q[i].flag==1) { int ans=f.find(q[i].v); if(ans==1) out[++num]=0; else out[++num]=G.e[id[ans]].id; }

		else {

			link(q[i].u, q[i].v, lca[i], i);

		}

	}

	for3(i, num, 1) printf("%d\n", out[i]);

	return 0;

}