// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 200005
#define inf 0x3f3f3f3f

int n;
vi e[maxn];
int fa[maxn];
char s[maxn];

multiset<int>mp[maxn];
int res[maxn];
int sz[maxn],son[maxn];
void dfs0(int u){
	sz[u]=1;
	son[u]=0;
	for(int v:e[u]){
		dfs0(v);
		sz[u]+=sz[v];
		if(sz[v]>sz[son[u]])son[u]=v;
	}
}

int f[maxn],sum[maxn];
int a[maxn];

void dfs(int u){
	for(int v:e[u])dfs(v);
	if(!e[u].size()){
		if(s[u]=='0')f[u]=0,sum[u]=0,mp[u].insert(1);
		else f[u]=1,sum[u]=-1,mp[u].insert(-1);
		res[u]=0;
		return;
	}
	swap(mp[son[u]],mp[u]),swap(f[u],f[son[u]]),swap(sum[u],sum[son[u]]);
	if(e[u].size()>1)
	{
	int mx=0;
	int mn=inf;
	for(int v:e[u])if(v!=son[u]){
		int t=f[v];
		a[0]+=t;
		int pos=0;
		for(auto it:mp[v]){
			t+=it;
			++pos;
			a[pos]+=t;
		}
		mx=max(mx,pos);
		mn=min(mn,pos);
	}
	mn=min(mn,mx);
	
	a[0]+=f[u];
	// auto it=mp[u].begin();
	int pos=0;
	int t=f[u];
	while(mp[u].size() && pos+1<=mn){
		auto it=mp[u].begin();
		t+=(*it);
		if((*it)<0) sum[u]-=(*it);
		++pos;
		a[pos]+=t;
		mp[u].erase(it);
	}
	sum[u]=0;
	mn=min(mn,pos);
	mp[u].clear();
	For(i,1,mn){
		mp[u].insert(a[i]-a[i-1]);
		if(a[i]-a[i-1]<0) sum[u]+=a[i]-a[i-1];
	}
	f[u]=a[0];
//	For(i,0,mn)cout<<a[i]<<" "; cout<<" a\n";
	For(i,0,mx)a[i]=0;
	}
	if(s[u]=='0') mp[u].insert(1);
	else mp[u].insert(-1),f[u]+=1,sum[u]-=1;
	
	res[u]=f[u]+sum[u];
	
	//cout<<"u: "<<u<<" "<<f[u]<<" "<<s[u]<<"\n";
	//for(auto x:mp[u])cout<<x<<" "; cout<<"\n";
}

void work()
{
	n=read();
	cin>>(s+1);
	For(i,1,n)e[i].clear(),mp[i].clear(),f[i]=sum[i]=0;
	For(i,2,n)fa[i]=read(),e[fa[i]].pb(i);
	dfs0(1);
	dfs(1);
	For(i,1,n)cout<<res[i]<<" "; cout<<"\n";
}

signed main()
{
	int T=read();
	while(T--)work();
    return 0;
}
/*
1
3 3 3
1 1
2 2
3 3
1 1 1
2 2 2
*/