#include<bits/stdc++.h>
#define deg(a) cout << #a << '=' << a << "\n"
#define all(a) a.begin(),a.end()
#define lowbit(x)  ((x)&(-x))
#define find1(x)  (__builtin_popcount(x))
#define pll pair<int,int>
// #define int long long   
#define endl '\n'
#define ff first
#define ss second
#define lc p<<1
#define rc p<<1|1
using namespace std;
using ll = long long;
const int N = 1e6+10;
const int M = 1e6+10;
const int mod1 = 998244353;
const int mod2 = 1e9+7;
const int inf = 0x3f3f3f3f3f3f3f;
const double eps = 1e-12;
int op[N];
std::vector<int> G[N];
int din[N] = {0};
int cnt[N] = {0};
std::vector<int> F[N];
int read()
{
    int k=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9')
    {
        if(c=='-')f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9')k=k*10+c-'0',c=getchar();
    return k*f;
}
void solve(){
     int n;
     cin >> n;
     for(int i = 1 ; i <= n ; i++) {
         G[i].clear();
         F[i].clear();
         din[i] = 0;
         cnt[i] = 0;
     }
     for(int i = 1 ; i <= n ; i++) {
         op[i] = read();
         // cin >> op[i];
         if(op[i] == 1) {
            int k;
            k = read();
            // cin >> k;
            for(int j = 1 ; j <= k ; j++) {
               int x;
               x = read();
               // cin >> x;
               F[i].push_back(x);
            }
         }else if(op[i] == 2) {
            int x,y;
            // cin >> x >> y;
            x = read();
            y = read();
            G[i].push_back(x);
            G[i].push_back(y);
            din[x]++;
            din[y]++;
         }
     }
     queue<int>q;
     for(int i = 1 ; i <= n ; i++) {
         if(din[i] == 0) {
            q.push(i);
            if(i == n) cnt[n] = 1;
         }
     }
     while(q.size()) {
         int u = q.front();
         q.pop();
         for(auto v : G[u]) {
            din[v]--;
            cnt[v] += cnt[u];
            if(din[v] == 0) {
               q.push(v);
            }
         }
     }
     map<int,int>mp;
     int sum = 0;
     int maxx = 0;
     for(int i = 1 ; i <= n ; i++) {
         if(op[i] == 2) continue;
         for(auto x : F[i]) {
            mp[x] += cnt[i];
            sum += cnt[i];
            maxx = max(maxx,mp[x]);
         }
     }
     int ans = 0; 
     int res = sum - maxx;
     if(maxx * 2 <= sum) {
         ans = sum;
     }else {
         ans = res * 2;
     }
     cout << ans << endl;
}
signed main()
{     
   // cin.tie(nullptr); 
   // ios::sync_with_stdio(false); 
   int kk = 1;
   cin >> kk;
   //cin.get(); 
   while(kk--) solve();
   return 0;
}