#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


// (without edge property)
// sub[u]: inside subtree at u, rooted at u
// bus[u]: outside subtree at u, rooted at par[u]
// tot[u]: rooted at u
// T: monoid representing information of a subtree.
//   T::init()  should assign the identity.
//   T::pull(const T &l, const T &r)  should assign the product.
//   T::up(int u)  should attach vertex u to the product of the subtrees.
template <class T> struct ForestDP {
  int n;
  vector<vector<int>> graph;
  vector<int> par;
  vector<T> sub, bus, tot;

  ForestDP() : n(0) {}
  explicit ForestDP(int n_) : n(n_), graph(n_) {}
  void ae(int u, int v) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    graph[u].push_back(v);
    graph[v].push_back(u);
  }
  void run() {
    par.assign(n, -2);
    sub.resize(n);
    bus.resize(n);
    tot.resize(n);
    for (int u = 0; u < n; ++u) if (par[u] == -2) {
      dfs0(u, -1);
      dfs1(u, -1);
    }
  }
  void dfs0(int u, int p) {
    par[u] = p;
    const int deg = graph[u].size();
    int w = -1;
    for (int j = deg; --j >= 0; ) {
      const int v = graph[u][j];
      if (p != v) {
        dfs0(v, u);
        if (~w) {
          bus[v].pull(sub[v], bus[w]);
        } else {
          bus[v] = sub[v];
        }
        w = v;
      }
    }
    if (~w) {
      sub[u] = bus[w];
    } else {
      sub[u].init();
    }
    sub[u].up(u);
  }
  void dfs1(int u, int p) {
    const int deg = graph[u].size();
    int v = -1;
    for (int j = 0; j < deg; ++j) {
      const int w = graph[u][j];
      if (p != w) {
        if (~v) {
          bus[v].pull(tot[v], bus[w]);
          bus[v].up(u);
          tot[w].pull(tot[v], sub[v]);
          dfs1(v, u);
        } else {
          if (~p) {
            tot[w] = bus[u];
          } else {
            tot[w].init();
          }
        }
        v = w;
      }
    }
    if (~v) {
      bus[v] = tot[v];
      bus[v].up(u);
      tot[u].pull(tot[v], sub[v]);
      dfs1(v, u);
    } else {
      if (~p) {
        tot[u] = bus[u];
      } else {
        tot[u].init();
      }
    }
    tot[u].up(u);
  }
};

////////////////////////////////////////////////////////////////////////////////

using U = unsigned long long;
int bsr(U x) {
  return 63 - __builtin_clzll(x);
}

#ifdef LOCAL
constexpr int E = 7;
#else
constexpr int E = 64;
#endif

int N;
vector<int> P;
vector<int> M;
vector<vector<U>> X;

struct Data {
  // (d, x): at depth d, add x to ann
  int len;
  pair<int, U> ps[E];
  void add(int d, U x) {
    for (int i = 0; i < len; ++i) {
      chmin(x, x ^ ps[i].second);
    }
    if (x) {
      ps[len++] = make_pair(d, x);
    }
  }

  void init() {
    len = 0;
  }
  void pull(const Data &a, const Data &b) {
    len = 0;
    for (int i = 0, j = 0; i < a.len || j < b.len; ) {
      if (i < a.len && ((j == b.len || a.ps[i].first < b.ps[j].first))) {
        add(a.ps[i].first, a.ps[i].second);
        ++i;
      } else {
        add(b.ps[j].first, b.ps[j].second);
        ++j;
      }
    }
  }
  void up(int u);

  U solve() const {
// cerr<<"solve ";pv(ps,ps+len);
    U ans = 0;
    int d = 0;
    U now = (E == 64) ? ~0ULL : ((1ULL << E) - 1);
    
    // distinct bsf
    U xs[E];
    for (int i = 0; i < len; ++i) {
      xs[i] = ps[i].second;
    }
    for (int i = 0; i < len; ++i) {
      const U low = xs[i] & -xs[i];
      for (int j = i + 1; j < len; ++j) if (xs[j] & low) {
        xs[j] ^= xs[i];
      }
    }
// cerr<<"  xs = ";pv(xs,xs+len);
    
    for (int i = 0; i < len; ++i) {
// cerr<<"["<<d<<", "<<ps[i].first<<"): "<<now<<endl;
      ans += (ps[i].first - d) * now;
      d = ps[i].first;
      
      // if now becomes bad, greedy fix
      for (int j = i; j >= 0; --j) {
        if (__builtin_parityll(now & xs[j])) {
          now ^= (xs[j] & -xs[j]);
        }
      }
    }
// cerr<<"["<<d<<", "<<N<<"): "<<now<<endl;
    ans += (N - d) * now;
    return ans;
  }
};

vector<Data> anns;
void Data::up(int u) {
  Data a = *this;
  *this = anns[u];
  for (int i = 0; i < a.len; ++i) {
    add(1 + a.ps[i].first, a.ps[i].second);
  }
}

int main() {
  for (; ~scanf("%d", &N); ) {
    P.assign(N, -1);
    for (int u = 1; u < N; ++u) {
      scanf("%d", &P[u]);
      --P[u];
    }
    M.resize(N);
    X.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%d", &M[u]);
      X[u].resize(M[u]);
      for (U &x : X[u]) {
        scanf("%llu", &x);
      }
    }
    
    anns.resize(N);
    for (int u = 0; u < N; ++u) {
      int dim = 0;
      U basis[E];
      for (const U x : X[u]) {
        U y = x;
        for (int i = 0; i < dim; ++i) {
          chmin(y, y ^ basis[i]);
        }
        if (y) {
          for (int i = 0; i < dim; ++i) {
            chmin(basis[i], basis[i] ^ y);
          }
          basis[dim++] = y;
        }
      }
      // triangular
      int bsrs[E];
      U used = 0ULL;
      for (int i = 0; i < dim; ++i) {
        bsrs[i] = bsr(basis[i]);
        used |= 1ULL << bsrs[i];
      }
      anns[u].init();
      for (int e = 0; e < E; ++e) if (!(used & 1ULL << e)) {
        U z = 1ULL << e;
        for (int i = 0; i < dim; ++i) if (basis[i] & 1ULL << e) {
          z |= 1ULL << bsrs[i];
        }
        anns[u].add(0, z);
      }
    }
    
    ForestDP<Data> f(N);
    for (int u = 1; u < N; ++u) {
      f.ae(P[u], u);
    }
    f.run();
    
    for (int u = 0; u < N; ++u) {
      const U ans = f.tot[u].solve();
      printf("%llu\n", ans);
    }
  }
  return 0;
}