#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int a[105],b[105],p[105],g[105],son[105];
int f[105][105],s[105][105];
int tt,t,w,n,res;
int main()
{
    cin>>tt;
    while(tt--)
    {
        cin>>n;
        res=0;
        memset(f,0,sizeof(f));
        memset(son,0,sizeof(son));
        for(int i=1;i<=n+1;i++)
        {
            cin>>a[i]>>b[i];
            f[a[i]][b[i]]++;
            f[b[i]][a[i]]++;
            son[a[i]]++;
            son[b[i]]++;
            s[a[i]][son[a[i]]]=b[i];
            s[b[i]][son[b[i]]]=a[i];
        }
        for(int i=1;i<=n+1;i++)
        for(int j=1;j<=n+1;j++)
        if(i<=j)
        {
            memset(p,0,sizeof(p));
            f[a[i]][b[i]]--;
            f[b[i]][a[i]]--;
            if(i!=j)
            {
                f[a[j]][b[j]]--;
                f[b[j]][a[j]]--;
            }
            int t=0;
            int w=1;
            g[1]=1;
            p[1]=1;
            while(t<w)
            {
                t++;
                for(int k=1;k<=son[g[t]];k++)
                {
                    int id=s[g[t]][k];
                    if(f[g[t]][id]>=1&&p[id]==0)
                    {
                        w++;
                        g[w]=id;
                        p[id]=1;
                    }
                }
            }
            if(t==n) res++;
            f[a[i]][b[i]]++;
            f[b[i]][a[i]]++;
            if(i!=j)
            {
                f[a[j]][b[j]]++;
                f[b[j]][a[j]]++;
            }
        }
        cout<<res<<endl;
    }
    return 0;
}