#include<bits/stdc++.h>

using namespace std;
using ll = long long;


void solve() {
	int n;
	string ss;
	cin >> n >> ss;
	vector<vector<int>> e(n);
	for(int i = 1;i < n;i ++) {
		int x;
		cin >> x;
		x --;
		e[x].push_back(i);
	}
	vector<int> f(n),neg(n);
	vector<set<int>> s(n);
	auto dfs = [&](auto self,int x) -> void {
        
        for(auto v:e[x]) {
        	self(self,v);
        	f[x] += f[v];
        	if(s[x].size() == 0) {
        		s[x].swap(s[v]);
                neg[x] = neg[v];
        		continue;
        	}
        	int len = min(s[x].size(),s[v].size());
        	auto it1 = s[x].begin();
        	auto it2 = s[v].begin();
        	set<int> tmp;
        	int negtmp = 0;
        	for(int i = 0;i < len;i ++,it1 ++,it2 ++) {
        		int val = *it1 + *it2;
        		if(val < 0)negtmp += val;
                tmp.insert(val);
        	}
        	neg[x] = negtmp;
        	s[x].swap(tmp);
        }
        f[x] += ss[x] - '0';
        if(ss[x] == '0') s[x].insert(1);
        else s[x].insert(-1),neg[x] -= 1;
        // cerr << x << " " << f[x] << endl;
	}; 
	dfs(dfs,0);
	for(int i = 0;i < n;i ++) {
		cout << f[i] + neg[i] << " \n"[i == n - 1];
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin >> T;
	while(T --) {
		solve();
	}
	return 0;
}