#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int t,n;
int father[110];
struct os
{
    int fa,son;
}a[210];
int find(int x)
{
    if (father[x]!=x) father[x]=find(father[x]);
    return father[x];
}
main()
{
    scanf("%d",&t);
    while (t--)
    {
        long long ans=0;
        scanf("%d",&n);
        for (int i=1;i<=n+1;i++)
        scanf("%d%d",&a[i].fa,&a[i].son);
        
        for (int i=1;i<=n+1;i++)
        {
            for (int j=1;j<=n;j++) father[j]=j;
            int flag=0;
            for (int j=1;j<=n+1;j++)
            if (j!=i)
            {
                int p=find(a[j].fa),q=find(a[j].son);
                if (p!=q) father[p]=q,flag++;
                if (flag>=n-1) break;
            }
            if (flag>=n-1) ans++;
        }
        
        for (int i=1;i<=n+1;i++)
        for (int j=i+1;j<=n+1;j++)
        {
            for (int k=1;k<=n;k++) father[k]=k;
            int flag=0;
            for (int k=1;k<=n+1;k++)
            if (i!=k&&j!=k)
            {
                int p=find(a[k].fa),q=find(a[k].son);
                if (p!=q) father[p]=q,flag++;
                if (flag>=n-1) break;
            }
            if (flag>=n-1) ans++;
        }
        cout<<ans<<endl;
    }
}