//#include<bits/stdc++.h>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define inf 1e9
#define ll long long
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define NM 100+5
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int f[NM],a[NM],b[NM],n,T,s;
bool v[NM];
int find(int x){
    return f[x]==x?x:f[x]=find(f[x]);
}
bool check(){
    mem(f);
    inc(i,1,n)f[i]=i;
    inc(i,1,n+1)if(!v[i]){
        int _x=find(a[i]),_y=find(b[i]);
        if(_x==_y)continue;
        f[_x]=_y;
    }
    inc(i,2,n)if(find(i)!=find(1))return false;
    return true;
}
int main(){
    T=read();
    while(T--){
        n=read();s=0;mem(a);mem(b);
        inc(i,1,n+1){
            a[i]=read();b[i]=read();
        }
        inc(i,1,n+1){
            v[i]++;
            if(check())s++;
            inc(j,i+1,n+1){
                v[j]++;
                if(check())s++;
                v[j]=false;
            }
            v[i]=false;
        }
        printf("%d\n",s);
    }
    return 0;
}