#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 5e4 + 7;
struct lb {
	ull f[64];
	lb() {
		me(f, 0);
	}
	ull & operator [] (int x) {
		return f[x];
	}
	void insert (ull x) {
		R(i, 63, 0) if(x >> i & 1) {
			if(!f[i]) f[i] = x;
			x ^= f[i];
		}
	}
	bool check(ull x) {
		R(i, 63, 0) if(x >> i & 1) {
			if(!f[i]) return false;
			x ^= f[i];
		}
		return true;
	}
	void clear () {
		me(f, 0);
	}
	int size () {
		int cnt = 0;
		L(i, 0, 63) if(f[i]) cnt += 1;
		return cnt;
	}
	int mxp () {
		R(i, 63, 0) if(f[i]) return i;
		return -1;
	}
	ull mxv() {
		ull ret = 0;
		R(i, 63, 0) if((ret ^ f[i]) > ret) ret ^= f[i];
		return ret;
	} 
} pre[100], now;
lb operator | (lb a, lb b) {
	R(i, 63, 0) if(a[i]) b.insert(a[i]);
	return b;
}
ull X[66], xo[66];
lb R[66];
ull iF[64], ID[64];
lb operator & (const lb &a, const lb &b) {
	lb qwq;
	int top = 0;
	me(iF, 0), me(ID, 0);
	R(tp, 63, 0) L(o, 0, 1) {
		ull W = o == 0 ? a.f[tp] : b.f[tp];
		ull w = W;
		
		ull ids = 1ull << top;
		R(i, 63, 0) if(w >> i & 1) {
			if(!iF[i]) {
				iF[i] = w, ID[i] = ids;
			}
			w ^= iF[i];
			ids ^= ID[i];
		}
		if(ids) {
			w = W;
			L(i, 0, top - 1) 
				if((ids >> i & 1) && xo[i] == o) 
					w ^= X[i];
			qwq.insert(w);
		} else {
			X[top] = W, xo[top] = o, ++top;
		}
	}
	return qwq;
}
lb ans[N];
int dep[N];
vi e[N];
ull ANS[N];
vi fn[N];
struct Depu {
	vector < pair < int, lb > > Fun;
	void reduce() {
		int p = 0;
		L(i, 0, sz(Fun) - 1) {
			if(!i || Fun[i].second.size() != Fun[i - 1].second.size()) {
				swap(Fun[p], Fun[i]);
				++p;
			}
		}
		if(p != sz(Fun)) {
			Fun.resize(p); 
		}
	}
	friend Depu operator & (Depu u, Depu v) {
		int x = 0, y = 0;
		Depu ans;
		while(x < sz(u.Fun) && y < sz(v.Fun)) {
			if(u.Fun[x].first <= v.Fun[y].first) {
				ans.Fun.emplace_back(u.Fun[x].first, 
					y > 0 ? u.Fun[x].second & v.Fun[y - 1].second : 
						u.Fun[x].second);
				++x;
			} else {
				ans.Fun.emplace_back(v.Fun[y].first, 
					x > 0 ? u.Fun[x - 1].second & v.Fun[y].second : 
						v.Fun[y].second);
				++y;
			}
		}
		ans.reduce();
		return ans;
	}
	Depu shift(int k) {
		Depu qwq = (*this);
		for(auto&u : qwq.Fun)
			u.first += k;
		return qwq;
	}
};
Depu dp[N];

int n, fa[N];
void dfs1(int x, int fa) {
	for(auto &v : e[x]) if(v != fa) {
		dfs1(v, x), dp[x] = dp[x] & dp[v].shift(1);
	} 
}
void dfs2(int x, int fa) {
	for(auto &v : e[x]) if(v != fa) {
		dp[v] = dp[v] & dp[x].shift(1), dfs2(v, x);
	} 
}
mt19937_64 orz;
int main() {
//	freopen("tree.in", "r", stdin);
//	freopen("tree.out", "w", stdout);
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	n = 100;
	cin >> n;
	L(i, 2, n) {
		fa[i] = i - 1;
		cin >> fa[i];
		e[fa[i]].emplace_back(i);
		e[i].emplace_back(fa[i]);
	}
	L(i, 1, n) {
		int cnt;
		cnt=63;
		cin >> cnt;
		lb F;
		while(cnt--) {
			ull w=orz();
			cin >> w;
			F.insert(w);
		} 
		dp[i].Fun.emplace_back(0, F);
		dp[i].Fun.emplace_back(n, lb());
	}
	dfs1(1, 0); 
	dfs2(1, 0);
	ull sim = 0;
	L(i, 1, n) {
		ull ans = 0;
		L(j, 0, sz(dp[i].Fun) - 2) 
			ans += dp[i].Fun[j].second.mxv() * (dp[i].Fun[j + 1].first - dp[i].Fun[j].first);
//		sim += ans;
		cout << ans << '\n';
	}
//	cout << sim << endl;
	return 0;
}