#include<cstdio>
#include<iostream>
#include<vector>
#include<utility>
#include<algorithm>
#define RI register int
#define CI const int&
using namespace std;
const int N=100005;
int t,n,x,ans[N]; char s[N]; vector <int> v[N];
struct delta
{
	vector <int> pos,neg; int zero,sum;
	inline delta(void)
	{
		pos.clear(); neg.clear(); zero=sum=0;
	}
	inline delta(vector <int>& vec)
	{
		zero=sum=0; pos.clear(); neg.clear();
		for (auto x:vec) if (x<0) neg.push_back(x),sum+=x;
		else if (x==0) ++zero; else pos.push_back(x);
		reverse(pos.begin(),pos.end());
	}
	inline int size(void)
	{
		return neg.size()+zero+pos.size();
	}
	inline int at(CI x)
	{
		if (x<neg.size()) return neg[x]; else
		if (x<neg.size()+zero) return 0; else
		return pos[pos.size()-1-(x-neg.size()-zero)];
	}
	inline void insert(CI x)
	{
		if (x==-1) neg.push_back(x),--sum; else pos.push_back(x);
	}
};
inline pair <int,delta> DFS(CI now=1)
{
	int st=0; delta d;
	for (auto to:v[now])
	{
		auto [x,vec]=DFS(to); st+=x;
		if (d.size()==0) d=vec; else
		{
			int lim=min(d.size(),vec.size());
			vector <int> tmp(lim);
			for (RI i=0;i<lim;++i) tmp[i]=d.at(i)+vec.at(i);
			d=delta(tmp);
		}
	}
	st+=s[now]-'0'; d.insert(s[now]=='0'?1:-1);
	ans[now]=st+d.sum; return make_pair(st,d);
}
int main()
{
	for (scanf("%d",&t);t;--t)
	{
		RI i; for (scanf("%d%s",&n,s+1),i=2;i<=n;++i)
		scanf("%d",&x),v[x].push_back(i);
		for (DFS(),i=1;i<=n;++i) printf("%d%c",ans[i]," \n"[i==n]),v[i].clear();
	}
	return 0;
}