// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T &x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T &x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 1e5 + 10;
int n, ans[N];
bool col[N];
vector <int> v[N];
struct info {
	vector <int> f1, f2;// f1: 负 f2：正
	int f0, cnt0, sumf1;
	int size() {
		return cnt0 + f1.size() + f2.size();
	}
} f[N];
info operator + (info x, info y) {
	info z;
	z.f0 = x.f0 + y.f0;
	z.cnt0 = z.sumf1 = 0;
	int w = min(x.size(), y.size());
	vector <int> t(w);
	int pos = 0;
	for (int i: x.f1) {
		if (pos >= w) break;
		t[pos++] += i;
	}
	pos += x.cnt0;
	reverse(all(x.f2));
	for (int i: x.f2) {
		if (pos >= w) break;
		t[pos++] += i;
	}
	pos = 0;
	for (int i: y.f1) {
		if (pos >= w) break;
		t[pos++] += i;
	}
	pos += y.cnt0;
	reverse(all(y.f2));
	for (int i: y.f2) {
		if (pos >= w) break;
		t[pos++] += i;
	}
	for (int i: t)
		if (i < 0) z.f1.push_back(i), z.sumf1 += i;
		else if (i > 0) z.f2.push_back(i);
			else z.cnt0++;
	reverse(all(z.f2));
	return z;
}
void dfs(int x) {
	if (v[x].empty()) {
		f[x].f0 = 0;
		f[x].cnt0 = f[x].sumf1 = 0;
		f[x].f1.clear();
		f[x].f2.clear();
	} else {
		for (int i: v[x]) dfs(i);
		swap(f[x], f[v[x].front()]);
		v[x].erase(v[x].begin());
		for (int i: v[x]) f[x] = f[x] + f[i];
	}
	if (col[x]) {
		f[x].f0++;
		f[x].sumf1--;
		f[x].f1.push_back(-1);
	} else f[x].f2.push_back(1);
	ans[x] = f[x].f0 + f[x].sumf1;
}
void zhk() {
	int n; read(n);
	F(i, 1, n) {
		v[i].clear();
		char ch = getchar();
		while (!isdigit(ch)) ch = getchar();
		col[i] = ch == '1';
	}
	F(i, 2, n) {
		int x; read(x);
		v[x].push_back(i);
	}
	dfs(1);
	F(i, 1, n) cout << ans[i] << " \n"[i == n];
}
signed main() {
	int _;
	read(_);
	while (_--) zhk();
	return 0;
}
/* why?
*/