#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>

using namespace std;
typedef long long ll;
vector<int>G[111];
int n;
int vis[111];
int maze[111][111];
int cnt;
void iscircle(int x){
    vis[x] = 1;
    int sz = G[x].size();
    for(int i=0;i<sz;i++){
        if(!vis[G[x][i]]){
            cnt++;
            vis[G[x][i]] = 1;
            iscircle(G[x][i]);
        }
    }
}
struct node{
    int a,b;
    node(int a= 0,int b= 0):a(a),b(b){}
}edge[111];
bool isliantong(){
    cnt = 0;
    memset(vis,0,sizeof(vis));
    iscircle(1);
    if(cnt == n-1) return 1;
    return 0;
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        for(int i=0;i<111;i++)
            G[i].clear();
        memset(vis,0,sizeof(vis));
        memset(edge,0,sizeof(edge));
        memset(maze,0,sizeof(maze));
         scanf("%d",&n);
         int cc = 0;
         int ff = 0;
         int ff2 = 0;
         int ttt = 0;
         for(int i=0;i<n+1;i++){
            int a,b;
            scanf("%d%d",&a,&b);
           // maze[a][b] ++;
           // maze[b][a]++;
            G[a].push_back(b);
            G[b].push_back(a);
            edge[cc++] = node(a,b);
            maze[a][b]++;
            maze[b][a]++;
            if(maze[a][b] == 3)
                ff = 1;

         }
         for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
            if(maze[i][j] == 2)
                ff2 = 1,ttt++;
         if(n == 2)
           printf("6\n");
         cnt = 0;
         iscircle(1);
         int ans = 0;
         if(cnt != n-1)
            printf("0\n");
            else{
                for(int i=0;i<cc;i++){
                    int a = edge[i].a;
                    int b = edge[i].b;
                    int j = 0;
                    vector<int>::iterator it = G[a].begin();
                    for(;it!=G[a].end();it++){
                        if(*it == b){
                          G[a].erase(it);break;
                        }
                    }
                      vector<int>::iterator its = G[b].begin();
                    for(;its!=G[b].end();its++){
                        if(*its == a){
                          G[b].erase(its);break;
                        }
                    }
                    if(isliantong())
                        ans++;
                    G[a].push_back(b);
                    G[b].push_back(a);
                }
                //printf("fff %d\n",ans);
                int ans2 = 0;
                for(int i=0;i<cc;i++){

                         int a = edge[i].a;
                        int b = edge[i].b;
                        vector<int>::iterator it = G[a].begin();
                        for(;it!=G[a].end();it++){
                            if(*it == b){
                              G[a].erase(it);break;
                            }
                        }
                          vector<int>::iterator its = G[b].begin();
                        for(;its!=G[b].end();its++){
                            if(*its == a){
                              G[b].erase(its);break;
                            }
                        }




                    if(isliantong()){
                        for(int j=0;j<cc;j++){
                            if(j == i) continue;
                            int c = edge[j].a;
                            int d = edge[j].b;
                           // cout<<c<<"  "<<d<<a<<" "<<b<<endl;
                            it = G[c].begin();
                            for(;it!=G[c].end();it++){
                                if(*it == d){
                                  G[c].erase(it);
                                 // cout<<"gg";
                                  break;
                                }
                            }
                              its = G[d].begin();
                            for(;its!=G[d].end();its++){
                                if(*its == c){
                                  G[d].erase(its);break;
                                }
                            }
                            if(isliantong()){
                                ans2++;
                            }
                             G[c].push_back(d);
                            G[d].push_back(c);
                        }
                    }
                    G[a].push_back(b);
                    G[b].push_back(a);
                }
                printf("%d\n",ans+ans2/2);
            }
    }
    return 0;
}