#include <bits/stdc++.h>
using namespace std;
const int N = 10100; 
vector<int> g[N];
int f[N], d[N];
unordered_map<int, unordered_map<int, int>> e;
void dfs(int u, int fa) {
    f[u] = fa;
    d[u] = d[fa] + 1;
    for (int v : g[u]) {
        if (v != fa) {
            dfs(v, u);
        }
    }
}
void get_pn(int a, int b, vector<int>& pn) {
    pn.clear();
    vector<int> pa, pb;
    while (a != b) {
        if (d[a] > d[b]) {
            pa.push_back(a);
            a = f[a];
        } else {
            pb.push_back(b);
            b = f[b];
        }
    }
    pa.push_back(a);
    reverse(pb.begin(), pb.end());
    pn = pa;
    for (int x : pb) pn.push_back(x);
}
void get_pe(int a, int b, vector<pair<int, int>>& pe) {
    pe.clear();
    while (a != b) {
        if (d[a] > d[b]) {
            pe.push_back({a, f[a]});
            a = f[a];
        } else {
            pe.push_back({b, f[b]});
            b = f[b];
        }
    }
}
void clr_e(const vector<int>& pn) {
    for (int x : pn) {
        for (int v : g[x]) {
            e[x][v] = 0;
            e[v][x] = 0;
        }
    }
}
void set_h(const vector<pair<int, int>>& pe) {
    for (auto& ed : pe) {
        int u = ed.first, v = ed.second;
        e[u][v] = 1;
        e[v][u] = 1;
    }
}
int cnt_h(const vector<pair<int, int>>& pe) {
    int cnt = 0;
    for (auto& ed : pe) {
        int u = ed.first, v = ed.second;
        if (e[u][v] == 1) cnt++;
    }
    return cnt;
}
void rst(int n) {
    for (int i = 1; i <= n; i++) {
        g[i].clear();
        f[i] = d[i] = 0;
    }
    e.clear();
}
int main() {
    freopen("edge.in", "r", stdin);
    freopen("edge.out", "w", stdout); 
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;
    while (T--) {
        int n, m;
        cin >> n >> m;
        rst(n);
        for (int i = 1; i < n; i++) {
            int u, v;
            cin >> u >> v;
            g[u].push_back(v);
            g[v].push_back(u);
            e[u][v] = 0;
            e[v][u] = 0;
        }
        d[0] = 0;
        dfs(1, 0);
        while (m--) {
            int op, a, b;
            cin >> op >> a >> b;
            if (op == 1) {
                vector<int> pn;
                get_pn(a, b, pn);
                clr_e(pn);
                
                vector<pair<int, int>> pe;
                get_pe(a, b, pe);
                set_h(pe);
            } else if (op == 2) {
                vector<pair<int, int>> pe;
                get_pe(a, b, pe);
                cout << cnt_h(pe) << '\n';
            }
        }
    }
    return 0;
}