//#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=a;i<b;++i)
#define all(x) begin(x),end(x)
#define sz(x) (int)(x).size()
typedef unsigned long long int ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
const int MAXN = 1e6+1;
vector<int>adj[MAXN];
int par[MAXN],vis[MAXN],cycle[MAXN];
vector<int>cyc;

vector<int> min_cyclic_string(vector<int>s) {
    int n = sz(s);
    for(int i=0;i<n;i++)s.push_back(s[i]);
    n*=2;
    int i = 0, ans = 0;
    while (i < n / 2) {
        ans = i;
        int j = i + 1, k = i;
        while (j < n && s[k] <= s[j]) {
            if (s[k] < s[j])
                k = i;
            else
                k++;
            j++;
        }
        while (i <= k)
            i += j - k;
    }
    return vector<int>(s.begin()+ans,s.begin()+ans+n/2);
}
bool dfs(int v,int u){
    vis[v] = 1;
    for(int x:adj[v]){
        if(x==u)continue;
        if(vis[x]){
            int cur = v;
            while(true){
                cyc.push_back(cur);
                cycle[cur] = 1;
                cur = par[cur];
                if(cur == x)break;
            }
            cyc.push_back(x);
            cycle[x] = 1;
            return 1;
        }else{
            par[x] = v;
            if(dfs(x,v))return 1;
        }
    }
    return 0;
}
map<vector<int>,int>seen;
int lab[MAXN];
int ccnt = 0;
void dfs2(int v,int u){
    //cout<<v<<'\n';
    vector<int>h;
    for(int x:adj[v]){
        if(x==u || cycle[x])continue;
        dfs2(x,v);
        h.push_back(lab[x]);
    }
    sort(all(h));
    if(seen.find(h) == seen.end())seen[h] = ccnt++;
    lab[v] = seen[h];
}
vector<int>generate(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        int v,u;
        cin>>v>>u;
        adj[v].push_back(u);
        adj[u].push_back(v);
    }
    dfs(1,0);
    for(int x:cyc)dfs2(x,0);
    vector<int>ans;
    for(int x:cyc)ans.push_back(lab[x]);
    vector<int>tmp = ans;
    reverse(all(tmp));
    tmp = min_cyclic_string(tmp);
    ans = min_cyclic_string(ans);
    for(int i=0;i<sz(ans);i++){
        if(tmp[i] < ans[i]){
            ans = tmp;
            break;
        }else if(ans[i] < tmp[i])break;
    }
    
    for(int i=0;i<=n;i++){
        adj[i].clear();
        cycle[i] = 0;
        lab[i] = 0;
        vis[i] = 0;
        par[i] = 0;
    }
    cyc.clear();
    return ans;
}
map<vector<int>,int>iso;
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int t;
    cin>>t;
    while(t--){
        seen.clear();
        iso.clear();
        ccnt = 0;

        int k;
        cin>>k;
        while(k--){
            vector<int>v = generate();
            //for(int x:v)cout<<x<<" ";
            //cout<<'\n';
            iso[v] = 1;
        }
        cout<<sz(iso)<<'\n';
    }

}