#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#include <memory.h>
#include <set>
#include <string.h>
#include <list>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <queue>
#include <time.h>
#define ll long long
#define forn(i,n) for(int i=0;i<n;++i)
#define rep(i,n) for(int i=1;i<=n;++i)
#define repc(i,l,r) for(int i=l;i<=r;++i)
#define mp(a,b) make_pair(a,b)
#define llf long double
#define pii pair<int,int>
using namespace std;
int n;
struct Road{
    int u, v;
    void read(){
        scanf("%d%d", &u, &v);
    }
}rds[105];
int cnt;
int dsu[105];
void clear(){
    cnt = n-1;
    memset(dsu, 0, sizeof(dsu));
}
int getgp(int u){
    if (!dsu[u]) return u;
    return dsu[u] = getgp(dsu[u]);
}
void bind(int u,int v){
    u = getgp(u);
    v = getgp(v);
    if (u != v){
        --cnt;
        dsu[v] = u;
    }
}
void solve(){
    cin >> n;
    forn(i, n + 1){
        rds[i].read();
    }
    int res = 0;
    forn(i, n + 1){
        clear();
        forn(j, n + 1){
            if (i != j) bind(rds[j].u, rds[j].v);
        }
        if (!cnt){
            ++res;
            for (int j = i + 1; j < n + 1; ++j){
                clear();
                forn(k, n + 1)
                    if (k != i&&k != j)bind(rds[k].u, rds[k].v);
                if (!cnt) ++res;
            }
        }
    }
    cout << res << endl;
}
int main(){
//freopen("abc.txt", "r", stdin);
    int T;
    cin >> T;
    while (T--){
        solve();
    }
    return 0;
}