#include <bits/stdc++.h>
using namespace std;
using LL = long long;

void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;

    vector<vector<int>> e(n);
    for (int i = 1; i < n; ++i) {
        int x;
        cin >> x;
        --x;
        e[x].push_back(i);
    }

    vector<int> a(n), dep(n), son(n, -1);

    auto dfs0 = [&](auto &&self, int u) -> void {
        a[u] = (s[u] == '1');
        if (int(e[u].size()) == 0) {
            dep[u] = 1;
            return;
        }

        for (int v : e[u]) {
            self(self, v); 
            a[u] += a[v];
            if (son[u] == -1 || dep[son[u]] > dep[v]) {
                son[u] = v;
            }
        }

        dep[u] = dep[son[u]] + 1;
    };

    dfs0(dfs0, 0);
    vector<deque<int>> f(n);
    vector<int> ans(n), w(n);

    auto dfs1 = [&](auto &&self, int u) -> void {
        for (auto v : e[u]) {
            self(self, v);
        }
        if ((int)e[u].size() == 0) {
        } else if ((int)e[u].size() == 1) {
            f[u].swap(f[son[u]]);
            swap(w[u], w[son[u]]);
        } else {
            // f[u].swap(f[son[u]]);
            // swap(w[u], w[v]);

            int top = dep[u] - 1;
            vector<int> t(top);
            for (int v : e[u]) {
                auto it = f[v].begin();
                for (int i = 0; i < top; ++i, it++) {
                    t[i] += *it;
                }
            }

            for (auto x : t) {
                w[u] += min(x, 0);
                f[u].push_back(x);
            }
        }

        if (s[u] == '0') {
            f[u].push_back(1);
        } else {
            f[u].push_front(-1);
            w[u]--;
        }

        ans[u] = a[u] + w[u];
    };
    dfs1(dfs1, 0);

    for (int i = 0; i < n; ++i) {
        cout << ans[i] << " \n"[i == n - 1];
    }
}

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