#include <bits/stdc++.h>
#define fi first 
#define se second
#define mp make_pair
using namespace std;
typedef uint64_t u64;
const int N = 5e4 + 5;
int n, m, fa[N];
u64 x, sum;
struct basis 
{
    u64 a[64]; int b[64];
    void ins(u64 x) 
    {
        while(x) 
        {
            int i = 63 ^ __builtin_clzll(x);
            if(!a[i]) return a[i] = x, void();
            x ^= a[i];
        }
    }
    void ins(u64 x, int y) 
    {
        while(x) 
        {
            int i = __builtin_ctzll(x);
            if(!a[i]) return a[i] = x, b[i] = y, void();
            if(y < b[i]) swap(x, a[i]), swap(y, b[i]);
            x ^= a[i];
        }
    }
    void trans() 
    {
        for(int i = 63; i >= 0; i--) 
            for(int j = i - 1; j >= 0; j--) 
                if((a[i] >> j) & 1) a[i] ^= a[j];
        for(int i = 0; i < 64; i++) 
        {
            if(a[i]) a[i] = 0, b[i] = n;
            else 
            {
                a[i] = (1ull << i); 
                for(int j = i + 1; j < 64; j++) if((a[j] >> i) & 1) a[i] |= (1ull << j);
            }
        }
    }
    void merge(basis &b) {for(int i = 0; i < 64; i++) ins(b.a[i], b.b[i] + 1);}
    pair<u64, int> ask(int u) 
    {
        pair<u64, int> ans = mp(0, n);
        for(int i = 63; i >= 0; i--) 
        {
            if(b[i] > u) ans.fi |= (1ull << i), ans.se = min(ans.se, b[i]); 
            else if(__builtin_parityll(ans.fi & a[i])) ans.fi |= (1ull << i);
        }
        return ans;
    }
}f[N];
int main()
{
    scanf("%d", &n);
    for(int i = 2; i <= n; i++) scanf("%d", &fa[i]);
    for(int i = 1; i <= n; i++) 
    {
        scanf("%d", &m);
        while(m--) scanf("%llu", &x), f[i].ins(x);
        f[i].trans();
    }
    for(int i = n; i >= 2; i--) f[fa[i]].merge(f[i]);
    for(int i = 2; i <= n; i++) f[i].merge(f[fa[i]]);
    for(int i = 1; i <= n; i++) 
    {
        sum = 0;
        for(int l = 0, r; l < n; l = r) 
        {
            auto z = f[i].ask(l); r = z.se;
            sum += (r - l) * z.fi;
        }
        printf("%llu\n", sum);
    }
    return 0;
}