#include<bits/stdc++.h>
using namespace std;
#define MAXN 100005
#define MAXS 2000005
const int inf = 0x3f3f3f3f;
int t, n;
vector<int> e[MAXN];
char s[MAXN];
int val[MAXN], nxt[MAXN], tot;
int st[MAXN], pos1[MAXN], pos2[MAXN], ans[MAXN], head[MAXN];
int dep[MAXN];

void push(int x, int y){
	// printf("(%d, %d)\n", x, y);
	e[x].push_back(y);
}

void dfs(int x){
	dep[x] = 0x3f3f3f3f;
	for(auto v : e[x]){
		dfs(v);
		dep[x] = min(dep[x], dep[v] + 1);
	}
	if(dep[x] == 0x3f3f3f3f) dep[x] = 1;
}

void merge(int x, int y){
// printf("merge(%d, %d)\n", x, y);
	int a = head[x], b = head[y];
	st[x] += st[y];
	for(int i=1;i<dep[x];i++){
		a = nxt[a], b = nxt[b];
		val[a] += val[b];
	}
	nxt[a] = 0;
	a = head[x];
	int sum = st[x];
	// printf("#####x = %d, st = %d\n", x, st[x]);
	for(int i=0;i<dep[x];i++){
		// printf("sum = %d, val[a] = %d, val[nxt[a] = %d] = %d\n", sum, val[a], nxt[a], val[nxt[a]]);
		if(val[a] < 0 && val[nxt[a]] >= 0) pos1[x] = a, ans[x] = sum;
		if(val[a] <= 0 && val[nxt[a]] > 0) pos2[x] = a;
		a = nxt[a];
		sum += val[a];
	}
	// puts("");
}

void show(int x){
	printf("x = %d, dep[x] = %d, st = %d, ans = %d\n", x, dep[x], st[x], ans[x]);
	int now = nxt[head[x]];
	while(now) printf("%d ", val[now]), now = nxt[now]; puts("");

}

void dfs1(int x){
	// printf("x = %d\n", x);
	if(e[x].size() == 0){
		ans[x] = 0;
		head[x] = tot+1;
		if(s[x] == '0'){
			st[x] = 0;
			val[++tot] = -inf;
			++tot;
			nxt[tot-1] = tot;
			val[tot] = 1;
			pos1[x] = pos2[x] = tot-1;
		}else{
			st[x] = 1;
			val[++tot] = -inf;
			++tot;
			nxt[tot-1] = tot;
			val[tot] = -1;
			pos1[x] = pos2[x] = tot;
		}
		// printf("##x = %d, st = %d, ans = %d\n", x, st[x], ans[x]);
		// int now = nxt[head[x]];
		// while(now) printf("%d ", val[now]), now = nxt[now]; puts("");
		return;
	}
	ans[x] = n;
	dfs1(e[x][0]);
	st[x] = st[e[x][0]], pos1[x] = pos1[e[x][0]];
	pos2[x] = pos2[e[x][0]], ans[x] = ans[e[x][0]];
	head[x] = head[e[x][0]];
	// show(x);
	for(int i=1;i<e[x].size();i++){
		int v = e[x][i];
		dfs1(v);
		merge(x, v);
		// show(x);
	}
	if(s[x] == '0'){
		int nx = nxt[pos2[x]];
		val[++tot] = 1;
		nxt[pos2[x]] = tot;
		nxt[tot] = nx;
	}else{
		st[x]++;
		int nx = nxt[pos1[x]];
		val[++tot] = -1;
		nxt[pos1[x]] = tot;
		nxt[tot] = nx;
		if(pos2[x] == pos1[x]) pos2[x] = tot;
		pos1[x] = tot;
	}
	// show(x);
}

void work(){
	scanf("%d", &n);
	scanf("%s", s+1);
	int x;
	for(int i=2;i<=n;i++) scanf("%d", &x), push(x, i);
	dfs(1); dfs1(1);
	for(int i=1;i<=n;i++) printf("%d ", ans[i]);
	puts("");
	for(int i=1;i<=tot;i++) val[i] = 0, nxt[i] = 0;
	tot = 0;
	for(int i=1;i<=n;i++) e[i].clear();
}

int main(){
	val[0] = inf;
	cin>>t;
	while(t--) work();
	return 0;
}