RT。调不动了。

#include <bits/stdc++.h>

using namespace std;

namespace liuzimingc {
const int N = 1e5 + 5;
#define endl '\n'

int T, n, m;
int dep[N], siz[N], son[N], dfn[N], cnt, top[N], cl[N], cr[N], fa[N];
vector<int> e[N];
struct tree {
    int l, r, sum, tag;
} t[N << 2];

void push_up(int p) {
	t[p].sum = t[p << 1].sum + t[p << 1 | 1].sum;
}

void push_down(int p) {
	if (~t[p].tag) {
		t[p << 1].tag = t[p].tag;
		t[p << 1].sum = (t[p << 1].r - t[p << 1].l + 1) * t[p].tag;
		t[p << 1 | 1].tag = t[p].tag;
		t[p << 1 | 1].sum = (t[p << 1 | 1].r - t[p << 1 | 1].l + 1) * t[p].tag;
		t[p].tag = -1;
	}
}

void build(int p, int l, int r) {
	t[p].l = l, t[p].r = r, t[p].sum = 0, t[p].tag = -1;
	if (l == r) return;
	int mid = l + r >> 1;
	build(p << 1, l, mid);
	build(p << 1 | 1, mid + 1, r);
}

void add(int p, int l, int r, int v) {
    if (l > r) return;
	if (l <= t[p].l && t[p].r <= r) {
		t[p].tag = v;
		t[p].sum = (t[p].r - t[p].l + 1) * v;
		return;
	}
	push_down(p);
	int mid = t[p].l + t[p].r >> 1;
	if (l <= mid) add(p << 1, l, r, v);
	if (r > mid) add(p << 1 | 1, l, r, v);
	push_up(p);
}

int ask(int p, int l, int r) {
    if (l > r) return 0;
	if (l <= t[p].l && t[p].r <= r) return t[p].sum;
	push_down(p);
	int mid = t[p].l + t[p].r >> 1, ans = 0;
	if (l <= mid) ans += ask(p << 1, l, r);
	if (r > mid) ans += ask(p << 1 | 1, l, r);
	return ans;
}

void dfs(int u, int fa) {
	int mx = 0;
	dep[u] = dep[fa] + 1;
	siz[u] = 1;
	liuzimingc::fa[u] = fa;
	for (const int &v : e[u]) {
		if (v == fa) continue;
		dfs(v, u);
		siz[u] += siz[v];
		if (siz[v] > siz[mx]) mx = v, son[u] = v;
	}
}

void dfs2(int u) {
	top[u] = u;
	for (int v = son[u]; v; v = son[v])
		dfn[v] = ++cnt, top[v] = u;
	for (int v = u; v; v = son[v]) {
		cl[v] = cnt + 1;
		for (const int &i : e[v])
			if (!dfn[i]) dfn[i] = ++cnt;
		cr[v] = cnt;
	}
	for (int v = u; v; v = son[v])
		for (const int &i : e[v])
			if (!top[i]) dfs2(i);
}

int lca(int u, int v) {
	while (top[u] != top[v]) {
		if (dep[top[u]] < dep[top[v]]) swap(u, v);
		u = fa[top[u]];
	}
	if (dep[u] > dep[v]) swap(u, v);
	return u;
}

void update(int u, int v) {
	int l = lca(u, v);
	add(1, dfn[l], dfn[l], 0);
	add(1, cl[l], cr[l], 0);
	if (son[l]) add(1, dfn[son[l]], dfn[son[l]], 0);
	for (int x : { u, v }) { // read-only!!!
		int lst = 0;
		while (top[x] != top[l]) {
			add(1, cl[top[x]], cr[x], 0);
			if (son[x]) add(1, dfn[son[x]], dfn[son[x]], 0);
			add(1, dfn[top[x]] + 1, dfn[x], 1);
			if (lst) add(1, dfn[lst], dfn[lst], 1);
			lst = top[x];
			x = fa[top[x]];
		}
		if (x != l) {
			add(1, cl[son[l]], cr[x], 0);
			if (son[x]) add(1, dfn[son[x]], dfn[son[x]], 0);
			add(1, dfn[l] + 1, dfn[x], 1);
		}
		if (lst) add(1, dfn[lst], dfn[lst], 1);
	}
}

int query(int u, int v) {
	int l = lca(u, v), ans = 0;
	for (int x : { u, v }) {
		int lst = 0;
		while (top[x] != top[l]) {
			ans += ask(1, dfn[top[x]] + 1, dfn[x]);
			if (lst) ans += ask(1, dfn[lst], dfn[lst]);
			lst = top[x];
			x = fa[top[x]];
		}
		if (x != l) {
			ans += ask(1, dfn[l] + 1, dfn[x]);
		}
		if (lst) ans += ask(1, dfn[lst], dfn[lst]);
	}
	return ans;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	cin >> T;
	while (T--) {
		cin >> n >> m;
		for (int i = 1; i <= n; i++) e[i].clear(), dep[i] = siz[i] = son[i] = dfn[i] = top[i] = cl[i] = cr[i] = fa[i] = 0;
		cnt = 0;
		for (int i = 1; i < n; i++) {
			int u, v;
			cin >> u >> v;
			e[u].push_back(v);
			e[v].push_back(u);
		}
		dfs(1, 0);
		dfn[1] = ++cnt;
		dfs2(1);
		build(1, 1, n);
		while (m--) {
			int op, u, v;
			cin >> op >> u >> v;
			if (op == 1) update(u, v);
			else cout << query(u, v) << endl;
		}
	}
	return 0;
}
}

int main() {
	liuzimingc::main();
	return 0;
}