#include <bits/stdc++.h>
using namespace std;

#define int long long
#define endl '\n'

void solve() {
  int n;
  cin >> n;
  vector<vector<int>> a(n + 1);
  vector<unordered_map<int, int>> b(n + 1);
  for (int i = 1; i <= n; i++) {
    int op;
    cin >> op;
    if (op == 1) {
      int m;
      cin >> m;
      a[i].resize(m);
      for (int j = 0; j < m; j++)
        cin >> a[i][j];
    } else {
      int x, y;
      cin >> x >> y;
      if (b[x].size())
        for (auto [num, cnt] : b[x])
          b[i][num] += cnt;
      else
        b[i][x]++;

      if (b[y].size())
        for (auto [num, cnt] : b[y])
          b[i][num] += cnt;
      else
        b[i][y]++;
    }
  }

  unordered_map<int, int> mp;
  if (a[n].size())
    for (auto x : a[n])
      mp[x]++;
  else
    for (auto [num, cnt] : b[n]) {
      for (auto x : a[num]) {
        mp[x] += cnt;
      }
    }

  int mx = 0, total = 0, res = 0;
  for (const auto &[k, v] : mp) {
    mx = max(v, mx);
    total += v;
  }
  if (mx <= total - mx) {
    res = total;
  } else {
    res = 2 * (total - mx);
  }

  cout << res << endl;
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  int T;
  cin >> T;
  while (T--)
    solve();
}