#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cerrno>
#include<cfloat>
#include<ciso646>
#include<climits>
#include<clocale>
#include<complex>
#include<csetjmp>
#include<csignal>
#include<cstdarg>
#include<cstddef>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cwchar>
#include<cwctype>
#include<deque>
#include<exception>
#include<fstream>
#include<functional>
#include<iomanip>
#include<ios>
#include<iosfwd>
#include<iostream>
#include<istream>
#include<iterator>
#include<limits>
#include<list>
#include<locale>
#include<map>
#include<memory>
#include<new>
#include<numeric>
#include<ostream>
#include<queue>
#include<set>
#include<sstream>
#include<stack>
#include<stdexcept>
#include<streambuf>
#include<string>
#include<typeinfo>
#include<utility>
#include<valarray>
#include<vector>
#include<string.h>
#include<stdlib.h>
#include<stdio.h>
#define ll   long long
//作者:中国江苏南京丁天行
using namespace std;
int t,n,f[105],x[105],y[105];
int cty(int x){return x==f[x]?x:f[x]=cty(f[x]);};
int main()
{
    scanf("%d",&t);
    while(t--){
               scanf("%d",&n);
               for(int i=1;i<=n+1;i++)scanf("%d%d",x+i,y+i);
               int ans=0;
               for(int i=1;i<=n+1;i++){
                       for(int j=1;j<=n;j++)f[j]=j;
                       for(int j=1;j<=n+1;j++){
                               if(j==i) continue;
                               if(cty(x[j])!=cty(y[j]))f[f[x[j]]]=f[y[j]];
                       }
                       int add=1;
                       for(int j=1;j<=n;j++)if(cty(j)!=f[1])add=0,j=n+1;
                       ans+=add;
               }
               for(int i=1;i<=n;i++){
                       for(int k=i+1;k<=n+1;k++){
                       for(int j=1;j<=n;j++)f[j]=j;
                       for(int j=1;j<=n+1;j++){
                               if(j==i||j==k) continue;
                               if(cty(x[j])!=cty(y[j]))f[f[x[j]]]=f[y[j]];
                       }
                       int add=1;
                       for(int j=1;j<=n;j++)if(cty(j)!=f[1])add=0,j=n+1;
                       ans+=add;
                       }
               }
               printf("%d\n",ans);
    }
    //system("pause");
    return 0;
}