#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
struct Info
{
    uint vl,vr,w;
    friend Info operator+(Info a,Info b)
    {
        if(!a.vl)return b;
        if(!b.vr)return a;
        return{a.vl,b.vr,a.w+b.w+(a.vr!=b.vl)};
    }
    Info swap(){return{vr,vl,w};}
};
struct Seg
{
    uint len;Seg*L,*R;bol tag;Info v;
    Seg(uint n):len(n),L(NULL),R(NULL),tag(false),v({0,0,0}){if(n>1)L=new Seg(n>>1),R=new Seg(n-(n>>1));}
    voi pushdown(){if(tag)L->chg(0,len>>1,v.vl),R->chg(0,len-(len>>1),v.vl),tag=false;}
    voi pushup(){v=L->v+R->v;}
    Info find(uint l,uint r)
    {
        if(l>=r)return{0,0,0};
        if(!l&&r==len)return v;
        pushdown();
        if(l<(len>>1))
            if(r<=(len>>1))return L->find(l,r);
            else return L->find(l,len>>1)+R->find(0,r-(len>>1));
        else return R->find(l-(len>>1),r-(len>>1));
    }
    voi chg(uint l,uint r,uint w)
    {
        if(l>=r)return;
        if(!l&&r==len){v={w,w,0},tag=true;return;}
        pushdown();
        if(l<(len>>1))
            if(r<=(len>>1))L->chg(l,r,w);
            else L->chg(l,len>>1,w),R->chg(0,r-(len>>1),w);
        else R->chg(l-(len>>1),r-(len>>1),w);
        pushup();
    }
}*S;
std::vector<uint>Way[100005];
uint Siz[100005],Heavy[100005],Fath[100005],Rot[100005],Dep[100005],Dfn[100005],cnt;
voi dfs1(uint p,uint f)
{
    Siz[p]=1,Fath[p]=f,Heavy[p]=-1;
    for(auto s:Way[p])if(s!=f)
    {
        Dep[s]=Dep[p]+1,dfs1(s,p),Siz[p]+=Siz[s];
        if(!~Heavy[p]||Siz[s]>Siz[Heavy[p]])Heavy[p]=s;
    }
}
voi dfs2(uint p,uint r)
{
    Rot[p]=r,Dfn[p]=cnt++;if(~Heavy[p])dfs2(Heavy[p],r);else return;
    for(auto s:Way[p])if(s!=Fath[p]&&s!=Heavy[p])dfs2(s,s);
}
uint lca(uint u,uint v) // test
{
    while(u[Rot]!=v[Rot])
    {
        if(u[Rot][Dep]<v[Rot][Dep])std::swap(u,v);
        u=u[Rot][Fath];
    }
    return u[Dep]<v[Dep]?u:v;
}
Info _get(uint y,uint o)
{
    Info ans{0,0,0};
    while(Rot[y]!=Rot[o])ans=S->find(Dfn[Rot[y]],Dfn[y]+1)+ans,y=Fath[Rot[y]];
    ans=S->find(Dfn[o],Dfn[y]+1)+ans;return ans;
}
voi _chg(uint y,uint o,uint c)
{
    while(Rot[y]!=Rot[o])S->chg(Dfn[Rot[y]],Dfn[y]+1,c),y=Fath[Rot[y]];
    S->chg(Dfn[o],Dfn[y]+1,c);
}
uint get(uint u,uint v){uint r=lca(u,v);return Dep[u]+Dep[v]-Dep[r]*2-(_get(u,r).swap()+_get(v,r)).w;}
voi chg(uint u,uint v,uint c){uint r=lca(u,v);_chg(u,r,c),_chg(v,r,c);}
voi solve()
{
    uint n,q;scanf("%u%u",&n,&q),cnt=0;
    for(uint i=0;i<n;i++)Way[i].clear();
    for(uint i=1,u,v;i<n;i++)scanf("%u%u",&u,&v),Way[--u].push_back(--v),Way[v].push_back(u);
    dfs1(0,0),dfs2(0,0);
    S=new Seg(n);
    uint w=1;for(uint i=0;i<n;i++)S->chg(Dfn[i],Dfn[i]+1,w++);
    while(q--)
    {
        uint op,u,v;scanf("%u%u%u",&op,&u,&v);
        if(op==1)chg(u-1,v-1,w++);else printf("%u\n",get(u-1,v-1));
    }
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint t;scanf("%u",&t);while(t--)solve();
    return 0;
}