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

typedef long long ll;
#define endl '\n'

void solve() {
  int n;
  cin >> n;
  vector<vector<ll>> a(n + 1);
  vector<map<ll, ll>> b(n + 1);
  for (int i = 1; i <= n; i++) {
    ll op;
    cin >> op;
    if (op == 1) {
      ll m;
      cin >> m;
      a[i].resize(m);
      for (int j = 0; j < m; j++)
        cin >> a[i][j];
    } else // op=2
    {
      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]++;
    }
  }

  // for (auto x : a[1])
  //   cerr << x << ' ';
  // cerr << endl;
  map<ll, ll> 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;
        // cerr << x << ": " << cnt << endl;
      }
    }

  vector<ll> tmp;
  for (const auto &[k, v] : mp) {
    // cerr << k << ": " << v << endl;
    tmp.push_back(v);
  }
  sort(tmp.begin(), tmp.end(), greater<int>());
  ll mx = tmp.front(), total = 0;
  ll res = 0;
  for (ll &it : tmp) {
    total += it;
    // cerr << it << ' ';
  }
  // cerr << endl;
  // cerr << total << ' ' << mx << endl;
  if (mx <= total - mx) {
    res = total;
  } else {
    res = 2 * (total - mx);
  }

  cout << res << endl;
}

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