#include<cstdio>
#include<cstdlib>
#include<time.h>
#include<cmath>
#include<cstring>
#include<string>
#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#define Size 105
#define inf 2e9
#define INF 2e18
#define LL long long
#define ULL unsigned long long
#define Mod 1000000007
using namespace std;
int n,m,k;
struct node
{
    int s;
    int e;
};
vector<int> arr[105];
int maze[105][105];
vector<node> edge;
int vis[105];
void solve(int x)
{
    for(int i=0;i<arr[x].size();++i)
    {
        if(maze[x][arr[x][i]]&&!vis[arr[x][i]])
        {
            vis[arr[x][i]]=1;
            m++;
            solve(arr[x][i]);
//            vis[arr[x][i]]=0;
        }
    }
}

int main()
{
    #ifndef ONLINE_JUDGE
//        freopen("input.txt","r",stdin);
//        freopen("output.txt","w",stdout);
    #endif // ONLINE_JUDGE
    int t;
    int x,y,z;
//    int Case=0;
    cin>>t;
    while(t--)
//    cin>>n;
//    while(scanf("%d",&n)==1)
    {
        cin>>n;
        m=0;
        memset(maze,0,sizeof(maze));
//        memset(vis,0,sizeof(vis));
        for(int i=1;i<=n;++i)
        {
            arr[i].clear();
        }
        edge.clear();
        for(int i=0;i<=n;++i)
        {
            scanf("%d%d",&x,&y);
            arr[x].push_back(y);
            arr[y].push_back(x);
            maze[x][y]++;
            maze[y][x]++;
            node tmp={x,y};
            edge.push_back(tmp);
        }
        int ans=0;
        for(int i=0;i<=n;++i)
        {
            node tmp=edge[i];
            maze[tmp.s][tmp.e]--;
            maze[tmp.e][tmp.s]--;
            for(int j=i;j<=n;++j)
            {
                node tmp1=edge[j];
                maze[tmp1.s][tmp1.e]--;
                maze[tmp1.e][tmp1.s]--;
                if(j==i)
                {
                    maze[tmp1.s][tmp1.e]++;
                    maze[tmp1.e][tmp1.s]++;
                }
//                    cout<<2<<endl;
                    m=1;
                    memset(vis,0,sizeof(vis));
                    vis[1]=1;
                    solve(1);
                    if(m==n)
                    {
                        ans++;
                    }
                if(i!=j)
                {
                    maze[tmp1.s][tmp1.e]++;
                    maze[tmp1.e][tmp1.s]++;
                }
//                cout<<ans<<" "<<tmp.s<<" "<<tmp.e<<" "<<tmp1.s<<" "<<tmp1.e<<endl;
            }
            maze[tmp.s][tmp.e]++;
            maze[tmp.e][tmp.s]++;
        }
        printf("%d\n",ans);
    }
    return 0;
}