#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
#define N 105
int fi[N],c[N*2][2],sg[N],ln[N][2],ss,t,n,m;bool b[N];
inline int Read()
 {
     int x=0;char y;
     do y=getchar(); while (y<'0'||y>'9');
     do x=x*10+y-'0',y=getchar(); while (y>='0'&&y<='9');
     return x;
 }
inline void Line(int x,int y)
 {
     c[++ss][0]=y;c[ss][1]=fi[x];fi[x]=ss;
     c[++ss][0]=x;c[ss][1]=fi[y];fi[y]=ss;
 }
void DFS(int x)
 {
     if (b[x]) return;
     b[x]=true;
     for (int i=fi[x];i;i=c[i][1])
       DFS(c[i][0]);
     return;
 }
int main()
 {
     //freopen("input.txt","r",stdin);
     t=Read();
     while (t--)
      {
          n=Read();
          for (int i=1;i<=n+1;i++)
            ln[i][0]=Read(),ln[i][1]=Read();
          int ans=0;
          for (int i=0;i<=n+1;i++)
           for (int k=i+1;k<=n+1;k++)
            {
               bool flag=true;
               ss=1;memset(fi,0,sizeof fi);memset(b,0,sizeof b);
               for (int j=1;j<=n+1;j++)
                if (i!=j&&k!=j) Line(ln[j][0],ln[j][1]);
               DFS(1);
               for (int j=1;j<=n;j++)
                if (!b[j]) flag=false;
               ans+=flag;
            }
          cout <<ans<<endl;
      }
     return 0;
 }