#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;

const int N = 1e5 + 10;

struct Dif
{
    vi pos, neg;
    int cnt_zero, sum_neg, size;

    Dif() : size(0), cnt_zero(0), sum_neg(0) {};
    int at(int no)
    {
        if (no <= neg.size())
            return neg[no - 1];
        no -= neg.size();
        if (no <= cnt_zero)
            return 0;
        no -= cnt_zero;
        return pos[pos.size() - no];
    }
    void insert(int x)
    {
        size++;
        if (x == 1)
            pos.push_back(x);
        else if (x == -1)
        {
            neg.push_back(x);
            sum_neg += x;
        }
        else
            assert(0);
    }
    void merge(Dif dif)
    {
        if (this->size == 0)
        {
            (*this) = move(dif);
            return;
        }
        vi tmp;
        for (int i = 1; i <= min(dif.size, this->size); i++)
            tmp.push_back(this->at(i) + dif.at(i));
        (*this) = Dif(), this->size = tmp.size();
        for (auto i : tmp)
        {
            if (i > 0)
                pos.push_back(i);
            else if (i == 0)
                cnt_zero++;
            else
            {
                neg.push_back(i);
                sum_neg += i;
            }
        }
        reverse(pos.begin(), pos.end());
    }
};

vi G[N];
int ans[N], red[N];
string color;

void init(int n);
Dif solve(int u);

int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t, n;
    cin >> t;
    while (t--)
    {
        cin >> n;
        init(n);
        solve(1);
        for (int i = 1; i <= n; i++)
            cout << ans[i] << (i == n ? "\n" : " ");
    }
    return 0;
}

void init(int n)
{
    cin >> color;
    for (int i = 1; i <= n; i++)
        G[i].clear();
    int par;
    for (int i = 2; i <= n; i++)
    {
        cin >> par;
        G[par].push_back(i);
    }
}

Dif solve(int u)
{
    Dif dif;
    red[u] = (color[u - 1] == '1');
    for (auto v : G[u])
    {
        Dif tmp = solve(v);
        red[u] += red[v];
        dif.merge(tmp);
    }
    dif.insert(color[u - 1] == '0' ? 1 : -1);
    ans[u] = red[u] + dif.sum_neg;
    return move(dif);
}