#include <bits/stdc++.h>
using namespace std;
const long long LINF = 1e17;
const double pi = 3.1415926535897932;
const string endstr = "\n";
template <typename T>
T gcd(T a, T b) {
  return (a == 0) ? b : gcd(b % a, a);
}
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
bool p_comp_fs(const pair<long long, long long> p1,
               const pair<long long, long long> p2) {
  return p1.first < p2.first;
};
bool p_comp_fg(const pair<long long, long long> p1,
               const pair<long long, long long> p2) {
  return p1.first > p2.first;
};
bool p_comp_ss(const pair<long long, long long> p1,
               const pair<long long, long long> p2) {
  return p1.second < p2.second;
};
bool p_comp_sg(const pair<long long, long long> p1,
               const pair<long long, long long> p2) {
  return p1.second > p2.second;
};
template <typename T>
vector<T> uniquen(vector<T> vec) {
  sort((vec).begin(), (vec).end());
  vec.erase(unique(vec.begin(), vec.end()), vec.end());
  return vec;
}
inline long long popcnt(long long x) {
  return __builtin_popcountll((unsigned long long)x);
};
template <class T>
bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
bool bit(long long st, long long b) { return ((st >> b) & 1) == 1; }
bool restorePerm(long long N, long long st, vector<set<long long>> segs,
                 vector<long long>& ans) {
  long long now = st;
  while (ans.size() < N) {
    ans.push_back(now);
    for (set<long long>& seg : segs)
      if (seg.count(now) > 0) {
        seg.erase(now);
      }
    long long oidx = -1;
    for (long long i = 0; i < N - 1; i++) {
      auto& seg = segs[i];
      if (seg.size() == 1) {
        if (oidx == -1)
          oidx = i;
        else
          return false;
      }
    }
    if (oidx == -1) {
      bool ok = true;
      for (auto& seg : segs)
        if (seg.size() > 0) ok = false;
      return ok;
    }
    now = *segs.at(oidx).begin();
  }
  return true;
}
bool check(long long N, const vector<set<long long>>& segs,
           const vector<long long>& ans) {
  set<set<long long>> all_segs;
  for (long long i = 0; i < N; i++)
    for (long long j = (i + 1); j < N; j++) {
      set<long long> seg;
      for (long long k = (i); k < j + 1; k++) seg.insert(ans[k]);
      all_segs.insert(seg);
    }
  for (const auto& seg : segs) {
    if (all_segs.count(seg) == 0) return false;
  }
  return true;
}
vector<long long> solve(long long N, const vector<set<long long>> segs,
                        vector<long long> cnt) {
  for (long long st = 0; st < N; st++) {
    vector<long long> ans;
    if (restorePerm(N, st, segs, ans) && check(N, segs, ans)) {
      return ans;
    }
  }
  return {};
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  long long T;
  cin >> T;
  for (long long _ = 0; _ < T; _++) {
    long long N;
    cin >> N;
    vector<set<long long>> segs;
    segs.reserve(N);
    vector<long long> cnt(N);
    for (long long i = 0; i < N - 1; i++) {
      long long k;
      cin >> k;
      set<long long> seg;
      for (long long j = 0; j < k; j++) {
        long long s;
        cin >> s;
        s--;
        seg.insert(s);
        cnt[s]++;
      }
      segs.push_back(seg);
    }
    auto ans = solve(N, segs, cnt);
    for (long long i = 0; i < N; i++) cout << ans[i] + 1 << " ";
    cout << endstr;
  }
  return 0;
}
