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

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

int n, op, m, x, y, mx, res, total, tmp, t;

void solve() {
  cin >> n;
  vector<unordered_map<int, int>> a(n + 1);
  vector<unordered_map<int, int>> b(n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> op;
    if (op == 1) {
      cin >> m;
      while (m--) {
        cin >> tmp;
        ++a[i][tmp];
      }
    } else {
      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 [k, v] : a[n])
      mp[k] += v;
  else
    for (auto [num, cnt] : b[n]) {
      for (auto [k, v] : a[num]) {
        mp[k] += cnt * v;
      }
    }

  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_base::sync_with_stdio(0);
  cin.tie(0), cout.tie(0), cerr.tie(0);
  cin >> t;
  while (t--)
    solve();
}