#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
using namespace std;
int a[105];
struct thank{
    int v,id;
}temp;
vector<thank> v[105];
struct thanks{
    int a,b;
}p[105];
int flag[105],vans,vt;
void dfs(int x,int fa,int t1,int t2){
    flag[x]=1;
    vans++;
    int e=v[x].size();
    for(int i=0;i<e;i++){
        int y=v[x][i].v;
        if(v[x][i].id==t1 || v[x][i].id==t2) continue;
        if(y==fa || flag[y]) continue;
        dfs(y,x,t1,t2);
    }
}
int main(){
    int i,j,l,n,m,T,ans;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(i=1;i<=n;i++) v[i].clear();
        for(i=1;i<=n+1;i++){
            scanf("%d%d",&p[i].a,&p[i].b);
            temp.v=p[i].b;
            temp.id=i;
            v[p[i].a].push_back(temp);
            temp.v=p[i].a;
            v[p[i].b].push_back(temp);
        }
        ans=0;
        for(i=1;i<=n+1;i++){
            vans=0;
            memset(flag,0,sizeof(flag));
            dfs(1,0,i,0);
            if(vans==n){
                ans++;
            }
        }
        for(i=1;i<=n+1;i++){
            for(l=i+1;l<=n+1;l++){
                vans=0;
                memset(flag,0,sizeof(flag));
                dfs(1,0,i,l);
                if(vans==n){
                    ans++;
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}