#include <bits/stdc++.h>

using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)

using i64 = long long;
using i128 = __int128;

const int N = 1e5 + 5;

int n;
char s[N];
vector<int> e[N];
int fir[N], negsum[N];
multiset<int> st[N];

void dfs(int x, int fx) {
    for (auto y : e[x]) dfs(y, x);

    for (auto y : e[x]) {
        fir[x] += fir[y];
        if (st[x].size() == 0) {
            swap (st[x], st[y]);
            negsum[x] = negsum[y];
            continue; 
        }

        int lim = min(st[x].size(), st[y].size());
        multiset<int> tmp;
        int neg = 0;
        auto it1 = st[x].begin(), it2 = st[y].begin();
        for (int i = 0; i < lim; i ++, it1 ++, it2 ++) {
            int v = *it1 + *it2;
            if (v < 0) neg += v;
            else tmp.insert(v);
        }
        negsum[x] = neg;
        st[x] = tmp;
    }
    
    fir[x] += s[x] - '0';
    if (s[x] == '0') st[x].insert(1);
    else st[x].insert(-1), negsum[x] += -1;
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; i ++) cin >> s[i];
    for (int i = 1; i <= n; i ++) e[i].clear(), fir[i] = negsum[i] = 0, st[i].clear();
    for (int i = 2; i <= n; i ++) {
        int x;
        cin >> x;
        e[x].push_back(i);
    }
    dfs (1, 0);
    for (int i = 1; i <= n; i ++) {
        cout << fir[i] + negsum[i] << " \n"[i == n];
    }
}

int main() {
    ios :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int Case; 
    cin >> Case;
    while (Case --) solve();
    return 0;
}