#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;

const int N = 1e5 + 10;

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

struct Magic
{
    vi neg, pos;
    int zero, negSm;

    Magic() : zero(0), negSm(0) {};
    Magic(vi vec) : zero(0), negSm(0)
    {
        for (int x : vec)
        {
            if (x < 0)
                neg.push_back(x), negSm += x;
            else if (x == 0)
                zero++;
            else
                pos.push_back(x);
        }
        reverse(pos.begin(), pos.end());
    }

    int size()
    {
        return neg.size() + pos.size() + zero;
    }
    int at(int idx)
    {
        if (idx < neg.size())
            return neg[idx];
        else if (idx < neg.size() + zero)
            return 0;
        else
        {
            idx -= neg.size() + zero;
            return pos[pos.size() - 1 - idx];
        }
    }
    void insert(int x)
    {
        assert(x == 1 || x == -1);
        if (x == 1)
            pos.push_back(1);
        else
            neg.push_back(-1), negSm--;
    }
};

Magic dfs(int u)
{
    red[u] = color[u - 1] - '0';
    Magic magic;

    for (int v : G[u])
    {
        Magic tmp = dfs(v);
        red[u] += red[v];
        if (magic.size() == 0)
            magic = tmp;
        else
        {
            int sz = min(magic.size(), tmp.size());
            vector<int> vec(sz);
            for (int i = 0; i < sz; i++)
                vec[i] = magic.at(i) + tmp.at(i);
            magic = Magic(vec);
        }
    }
    if (color[u - 1] == '0')
        magic.insert(1);
    else
        magic.insert(-1);

    ans[u] = red[u] + magic.negSm;
    return magic;
}

void solve(int n)
{
    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);
    }
    dfs(1);
}

int main()
{
    int t, n;
    cin >> t;
    while (t--)
    {
        cin >> n >> color;
        solve(n);
        for (int i = 1; i <= n; i++)
            cout << ans[i] << " ";
        cout << endl;
    }
    return 0;
}