#include<bits/stdc++.h>
using namespace std;
#define rep2(i,j,k) for(ll i = ll(j); i < ll(k); i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i = ll(j)-1; i >= ll(k); i--)
#define rrep(i,k) rrep2(i,k,0)
#define all(a) a.begin(), a.end()
#define SZ(a) ll(a.size())
#define eb emplace_back
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
const ll inf = LLONG_MAX/4;
bool chmin(auto& a, auto& b) {return a > b ? a = b, 1 : 0; }
bool chmax(auto& a, auto& b) {return a < b ? a = b, 1 : 0; }

using u64 = uint64_t;
const u64 mod = inf;
u64 add(u64 a, u64 b) {
	a += b;
	if(a >= mod) a -= mod;
	return a;
}
u64 mul(u64 a, u64 b) {
	auto c = (__uint128_t) a * b;
	return add(c >> 61, c & mod);
}

mt19937_64 rng;
uniform_int_distribution<ll> dist(0, mod-1);

u64 hs[1000010];
u64 R;
u64 pw[1000010];

void solve() {
	int n;
	cin >> n;
	set<tuple<int, int, u64>> st;
	rep(_, n) {
		int k;
		cin >> k;
		vvp G(k);
		rep(i, k) {
			int u, v;
			cin >> u >> v;
			--u, --v;
			G[u].eb(v, i);
			if(v != u) G[v].eb(u, i);
		}
		vector<bool> on_c(k);
		vl cycle;
		{
			vl ls;
			vector<bool> seen(k);
			auto dfs = [&](auto &dfs, int u, int p) -> void {
				ls.eb(u);
				seen[u] = true;
				for(auto [v, id] : G[u]) {
					if(id == p) continue;
					if(seen[v]) {
						rrep(i, SZ(ls)) {
							on_c[ls[i]] = true;
							cycle.eb(ls[i]);
							if(ls[i] == v) return;
						}
					} else {
						dfs(dfs, v, id);
						if(!cycle.empty()) return;
					}
				}
				ls.pop_back();
			};
			dfs(dfs, 0, -1);
		}
		//for(ll u : cycle) cerr << u << ' ';
		//cerr << endl;
		auto dfs = [&](auto &dfs, int u, int p) -> pair<int, u64> {
			u64 res = 1;
			vector<u64> ls;
			int d = 0;
			for(auto [v,_] : G[u]) {
				if(v == p or on_c[v]) continue;
				auto [nd, nv] = dfs(dfs, v, u);
				if(nd+1 > d) d = nd+1;
				ls.eb(nv);
			}
			for(ll l : ls) res = mul(res, add(hs[d], l));
			return {d, res};
		};
		vl v;
		for(ll u : cycle) {
			u64 now = dfs(dfs, u, -1).second;
			//cerr << now << ' ';
			v.eb(now);
		}
		//cerr << endl;
		int sz = SZ(v);
		u64 mn = mod;
		rep(_, 2) {
			vector<u64> sl(sz+1), sr(sz+1);
			rrep(i, sz) sr[i] = add(mul(sr[i+1], R), v[i]);
			rep(i, sz) sl[i+1] = add(sl[i], mul(v[i], pw[i]));
			rep(i, sz) {
				u64 now = sr[i];
				now = add(now, mul(sl[i], pw[sz-i]));
				chmin(mn, now);
				//cerr << now << endl;
			}
			reverse(all(v));
		}
		st.insert({k, sz, mn});
	}
	cout << st.size() << endl;
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	rep(i, 1000010) hs[i] = dist(rng);
	R = dist(rng);
	pw[0] = 1;
	rep2(i, 1, 1000010) pw[i] = mul(pw[i-1], R);
	int t;
	cin >> t;
	rep(_, t) solve();
}