#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 5005 
#define int long long
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int T,n,m,h[N],cnt,a[N],d[N],fa[N],ans,x,y,z;
struct edge{int v,n;}e[N<<1];
void ad(int u,int v){e[++cnt]={v,h[u]};h[u]=cnt;}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void dfs(int u,int f)
{
    d[u]=d[fa[u]=f]+1;
    for(int i=h[u];i;i=e[i].n)
    {
        int v=e[i].v;
        if(v^f)dfs(v,u);
    }
}
void oper(int x,bool op)
{
    if(op){a[x]=1;return;}
    for(int i=h[x];i;i=e[i].n)
    {
        int v=e[i].v;
        a[v^fa[x]?v:x]=0;
    }
}
void ud(int x,int y,bool op)
{
    if(d[x]<d[y])swap(x,y);
    while(d[x]>d[y])
        oper(x,op),x=fa[x];
    if(x==y){if(!op)oper(x,op);return;}
    while(x^y)
        oper(x,op),oper(y,op),x=fa[x],y=fa[y];
    if(!op)oper(x,op);
}
int gs(int x,int y)
{
    int ans=0;
    if(d[x]<d[y])swap(x,y);
    while(d[x]>d[y])
        ans+=a[x],x=fa[x];
    if(x==y)return ans;
    while(x^y)
        ans+=a[x]+a[y],x=fa[x],y=fa[y];
    return ans;
}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("edge.in","r",stdin);freopen("edge.out","w",stdout);
    T=read();
    while(T--)
    {
        n=read();m=read();
        fo(i,1,n-1)x=read(),y=read(),ad(x,y),ad(y,x);
        dfs(1,0);
        while(m--)
        {
            z=read();x=read();y=read();
            if(z==1)ud(x,y,0),ud(x,y,1);
            else printf("%lld\n",gs(x,y));
        }
        fo(i,1,n)a[i]=h[i]=0;cnt=0;
    }
    return 0;
}