#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
#define parity __builtin_parityll
#define popcount __builtin_popcountll
using LL = long long;
using word = unsigned long long;
template <class word>
struct Lspace {
  static constexpr int N = sizeof(word) << 3;
  word p[N];
  Lspace() { memset(p, 0, sizeof p); }
  word operator[](int i) const { return p[i]; }
};
struct basis : Lspace<word> {
  void ins(word x) {
    if (!x) return ;
    for (int i = N; i--; ) if (x >> i & 1) {
      if (!p[i]) return p[i] = x, void();
      x ^= p[i];
    }
  }
  void guass() {
    for (int i = 0; i < N; i++) if (p[i]) {
      for (int j = i + 1; j < N; j++) if (p[j] >> i & 1) p[j] ^= p[i];
    }
  }
};
basis construct() {
  int m;
  word x;
  basis tmp{};
  cin >> m;
  while (m--) cin >> x, tmp.ins(x);
  return tmp;
}
struct linearBase : Lspace<word> {
  int ord[N];
  linearBase() { memset(ord, 0x3f, sizeof ord); }
  void ins(word x, int t) {
    if (!x) return ;
    for (int i = 0; i < N; i++) if (x >> i & 1) {
      if (!p[i]) return p[i] = x, ord[i] = t, void();
      if (t < ord[i]) swap(t, ord[i]), swap(x, p[i]);
      x ^= p[i];
    }
  }
};
linearBase sooke(basis src) {
  linearBase dst{};
  src.guass();
  for (int i = 0; i < src.N; i++) if (!src[i]) {
    word x = word{1} << i;
    for (int j = i + 1; j < src.N; j++) if (src[j] >> i & 1) x |= word{1} << j;
    dst.ins(x, 0);
  }
  return dst;
}
int n, fa[50010];
linearBase bas[50010];
word calc(const linearBase& src) {
  debug("src!\n");
  word ans = 0;
  vector<pair<int, int>> vec;
  for (int j = 0; j < src.N; j++) if (src[j]) vec.emplace_back(src.ord[j], j);
  sort(vec.begin(), vec.end());
  vec.emplace_back(n, src.N);
  ans += word(-1) * vec[0].first;
  vector<int> vis(src.N, false);
  for (size_t i = 0; i + 1 < vec.size(); i++) {
    vis[vec[i].second] = true;
    word now = -1;
    for (int j = src.N - 1; j >= 0; j--) if (vis[j] && parity(now & src[j])) now ^= 1ull << j;
    ans += now * (vec[i + 1].first - vec[i].first);
  }
  return ans;
}
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);  
#endif
  cin >> n;
  for (int i = 2; i <= n; i++) cin >> fa[i];
  for (int i = 1; i <= n; i++) {
    auto b = sooke(construct());
    for (int j = 0; j < b.N; j++) bas[i].ins(b[j], 0);
    debug("init:calc(%d) = %llu\n", i, calc(bas[i]));
  }
  for (int i = n; i >= 2; i--) {
    for (int j = 0; j < bas[i].N; j++) bas[fa[i]].ins(bas[i][j], bas[i].ord[j] + 1);
  }
  for (int i = 2; i <= n; i++) {
    for (int j = 0; j < bas[i].N; j++) bas[i].ins(bas[fa[i]][j], bas[fa[i]].ord[j] + 1);
  }
  for (int i = 1; i <= n; i++) cout << calc(bas[i]) << endl;
  return 0;
}