#include <bits/stdc++.h>
using namespace std;
long long const mod = 1000000007;
inline long long add(long long a, long long b) {
  return ((a % mod) + (b % mod) + mod) % mod;
}
inline long long mul(long long a, long long b) {
  return (((a % mod) * (b % mod)) % mod + mod) % mod;
}
inline long long sub(long long a, long long b) {
  return ((a % mod) - (b % mod) + mod) % mod;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long power(long long x, long long y, long long m) {
  if (y == 0) return 1;
  long long p = power(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
long long modInv(long long x) { return power(x, mod - 2, mod) % mod; }
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    set<long long> g[n - 1];
    map<set<long long>, long long> mp;
    for (long long i = 0; i < n - 1; i++) {
      long long k;
      cin >> k;
      for (long long j = 0; j < k; j++) {
        long long x;
        cin >> x;
        g[i].insert(x);
      }
      mp[g[i]]++;
    }
    vector<long long> v;
    for (long long i = 1; i <= n; i++) {
      bool f2 = true;
      v.clear();
      long long start = i;
      priority_queue<pair<long long, set<long long> >,
                     vector<pair<long long, set<long long> > >,
                     std::greater<pair<long long, set<long long> > > >
          pq;
      for (int j = 0; j < n - 1; j++) {
        pair<long long, set<long long> > p;
        p.first = g[j].size();
        p.second = g[j];
        pq.push(p);
      }
      while (v.size() != n - 1) {
        v.push_back(start);
        long long z = pq.size();
        priority_queue<pair<long long, set<long long> >,
                       vector<pair<long long, set<long long> > >,
                       std::greater<pair<long long, set<long long> > > >
            pq2;
        while (z--) {
          pair<long long, set<long long> > p = pq.top();
          pq.pop();
          if (p.second.find(start) != p.second.end()) {
            p.second.erase(start);
          }
          p.first = p.second.size();
          if (p.first != 0) {
            pq2.push(p);
          }
        }
        pq = pq2;
        pair<long long, set<long long> > p2 = pq.top();
        if (p2.first != 1) {
          f2 = false;
          break;
        } else {
          start = *p2.second.begin();
          pq.pop();
        }
        if (pq.empty() == 0) {
          pair<long long, set<long long> > p3 = pq.top();
          if (p3.first == 1) {
            f2 = false;
            break;
          }
        }
      }
      if (f2 == false) {
        continue;
      }
      v.push_back(start);
      long long count = 0;
      for (int j = n - 1; j > 0; j--) {
        set<long long> st;
        st.insert(v[j]);
        for (long long k = j - 1; k >= 0; k--) {
          st.insert(v[k]);
          if (mp[st] > 0) {
            count++;
          }
        }
      }
      if (count == n - 1) {
        break;
      }
    }
    for (auto x : v) cout << x << " ";
    cout << endl;
  }
  return 0;
}
