#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
const int N = 105;
int n;
int fa[N];
struct Info
{
    int a,b,c;
}xu[N];
int getint()
{
    int res=0;
    char ch=getchar();
    while((ch<'0' || ch>'9') && ch!='-')
        ch=getchar();
    bool fan=0;
    if(ch=='-')
    {
        fan=1;
        ch=getchar();
    }
    while('0'<=ch && ch<='9')
    {
        res=res*10+ch-'0';
        ch=getchar();
    }
    if(fan)
        res=-res;
    return res;
}
int getf(int x)
{
    if(fa[x]!=x)
        fa[x]=getf(fa[x]);
    return fa[x];
}
bool Can(int x,int y)
{
    int i;
    for(i=1;i<=n;i++)
        fa[i]=i;
    for(i=1;i<=n+1;i++)
    {
        if(x==i || y==i)
            continue;
        int a=getf(xu[i].a);
        int b=getf(xu[i].b);
        fa[a]=b;
    }
    for(i=2;i<=n;i++)
    {
        if(getf(i)!=getf(i-1))
            return 0;
    }
    return 1;
}
void f()
{
    int i,j;
    n=getint();
    for(i=1;i<=n+1;i++)
    {
        xu[i].a=getint();
        xu[i].b=getint();
    }
    int ans=0;
    for(i=1;i<=n+1;i++)
    {
        if(Can(i,0))
        {
            ans++;
            for(j=i+1;j<=n+1;j++)
            {
                if(Can(i,j))
                    ans++;
            }
        }
    }
    printf("%d\n",ans);
}
int main()
{
    int T=getint();
    while(T--)
        f();
    return 0;
}