#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long mod5 = 1000000009;
long long inf = 1LL << 62;
double pi = 3.141592653589793238462643383279L;
double eps = 1e-14;
int dh[4] = {1, -1, 0, 0};
int dw[4] = {0, 0, 1, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long c = gcd(a, b);
  return a * b / c;
}
long long Pow(long long n, long long k) {
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
long long beki(long long n, long long k, long long md) {
  long long ret = 1;
  long long now = n;
  now %= md;
  while (k > 0) {
    if (k % 2 == 1) {
      ret *= now;
      ret %= md;
    }
    now *= now;
    now %= md;
    k /= 2;
  }
  return ret;
}
long long gyaku(long long n, long long md) { return beki(n, md - 2, md); }
long long popcount(long long n) {
  long long ret = 0;
  long long u = n;
  while (u > 0) {
    ret += u % 2;
    u /= 2;
  }
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  for (long long _ = 0; _ < t; _++) {
    int n;
    cin >> n;
    int cnt[n + 1];
    fill(cnt, cnt + n + 1, 0);
    set<int> st[n + 1];
    vector<int> v[n];
    for (long long i = 0; i < n - 1; i++) {
      int k;
      cin >> k;
      for (long long j = 0; j < k; j++) {
        int a;
        cin >> a;
        st[a].insert(i);
        v[i].push_back(a);
        cnt[a]++;
      }
    }
    vector<int> vvv;
    for (long long i = 1; i < n + 1; i++) {
      if (cnt[i] == 1) {
        vvv.push_back(i);
      }
    }
    vector<int> ans;
    for (long long u = 0; u < vvv.size(); u++) {
      ans.clear();
      int ok[n + 1];
      fill(ok, ok + n + 1, 0);
      bool used[n + 1];
      fill(used, used + n + 1, false);
      int rrr = 0;
      int cnt2[n + 1];
      for (long long i = 1; i < n + 1; i++) cnt2[i] = cnt[i];
      set<int> st2[n + 1];
      for (long long i = 1; i < n + 1; i++) st2[i] = st[i];
      for (long long i = 0; i < n - 1; i++) {
        int maa = -1;
        int numm = -1;
        int maaa = 0;
        for (long long j = 1; j < n + 1; j++) {
          if (used[j] == false) maaa = max(maaa, ok[j]);
          if (cnt2[j] == 1 && used[j] == false) {
            if (ok[j] > maa) {
              maa = ok[j];
              numm = j;
            }
          }
        }
        if (i == 0) numm = vvv[u];
        if (ok[numm] < maaa) {
          rrr = 1;
          break;
        }
        ans.push_back(numm);
        int pla = *st2[numm].begin();
        used[numm] = true;
        for (long long k = 0; k < v[pla].size(); k++) {
          int ne = v[pla][k];
          cnt2[ne]--;
          st2[ne].erase(pla);
          ok[ne]++;
        }
      }
      if (rrr) continue;
      for (long long i = 1; i < n + 1; i++) {
        if (used[i] == false) ans.push_back(i);
      }
      break;
    }
    reverse(ans.begin(), ans.end());
    for (long long i = 0; i < n; i++) cout << ans[i] << " ";
    cout << endl;
  }
}
