// clang-format off
#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
mt19937 gen(time(0));
typedef long long ll; 
typedef unsigned long long ull; 
typedef pair<int,int> pii; typedef pair<ll,int> pli; typedef pair<ll,ll> pll; typedef pair<int,ll> pil;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int mod=998244353;
inline int fp(int x,ll p=mod-2,int m=mod,int res=1){
	for(;p;p>>=1){if(p&1)res=1ll*res*x%m;x=1ll*x*x%m;}
	return res;
}
inline void plust(int &x,int y){x=x+y>=mod?x+y-mod:x+y;}
const int N=5e4+3;
const int M=64;
// clang-format on
int n;
vector<int>G[N];
ull ans=0;
struct basis{
	ull a[M];
	int ord[M];
	inline void insert(ull x,int od){
		if(!x)return;
		per(i,M-1,0)if(bit(x,i)){
			if(!a[i]){a[i]=x,ord[i]=od;return ;}
			if(ord[i]>od)swap(od,ord[i]),swap(x,a[i]);
			x^=a[i];
		}
	}
	inline void insert2(ull x,int od){
		if(!x)return;
		rep(i,0,M-1)if(bit(x,i)){
			if(!a[i]){a[i]=x,ord[i]=od;return ;}
			if(ord[i]>od)swap(od,ord[i]),swap(x,a[i]);
			x^=a[i];
		}
	}
	inline void reverse(){
		per(i,M-1,0)per(j,i-1,0)if(bit(a[i],j))a[i]^=a[j];
		static ull b[M];
		per(i,M-1,0)if(!a[i]){
			b[i]=1llu<<i;
			per(j,M-1,i+1)if(bit(a[j],i))b[i] |= 1llu<<j;
		}
		rep(i,0,M-1)a[i]=b[i];
		memset(b,0,sizeof b);
		memset(ord,0,sizeof ord);
	}
	inline void query(){// in reverse
		static int id[M];rep(i,0,M-1)id[i]=i;
		sort(id,id+M,[&](int i,int j){return ord[i]<ord[j];});
		static bool inq[M];memset(inq,0,sizeof inq);
		rep(i,0,M-1){
			inq[id[i]]=1; ull x=(M==64?(~0):(1llu<<M)-1);
			per(j,M-1,0)if(inq[j]) x^=(pnp(a[j]&x)&1ll)<<j;
			ans += ((i==M-1?n:ord[id[i+1]])-ord[id[i]])*x;
		}
	}
	inline void merge(const basis &A,int d=1){
		rep(i,0,M-1)insert2(A.a[i],A.ord[i]+d);
	}
	inline void clear(){
		memset(a,0,sizeof a);
		memset(ord,0,sizeof ord);
	}
}t[N],a[N],out,suf[N];
int fa[N];
ull res[N];
inline void dfs(int u){
	ans=0;
	basis bs=t[u];bs.merge(out);bs.query();
	res[u]=ans;
	if(G[u].empty())return ;
	basis old=out;
	rep(i,0,M-1)if(out.a[i])++out.ord[i];
	out.merge(a[u],0);
	per(i,(int)G[u].size()-2,0){
		suf[G[u][i]]=suf[G[u][i+1]];
		suf[G[u][i]].merge(t[G[u][i+1]],0);
	}
	basis pre;pre.clear();
	rep(i,0,G[u].size()-1){
		basis tmp=out;
		out.merge(pre);
		out.merge(suf[G[u][i]]);
		dfs(G[u][i]);
		out=tmp;
		pre.merge(t[G[u][i]],0);
	}
	out=old;
}
int main() {
    //freopen("data.in", "r", stdin);
    // freopen(".in","r",stdin);
    // freopen("myans.out","w",stdout);
	n=read();rep(i,2,n)G[fa[i]=read()].pb(i);
	rep(i,1,n){
		int m=read();
		while(m--)a[i].insert(read(),0);
		a[i].reverse();
		t[i]=a[i];
	}
	per(i,n,2)t[fa[i]].merge(t[i]);
	dfs(1);
	rep(i,1,n)printf("%llu\n",res[i]);
    return 0;
}