#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;

const int N = 1e5 + 10;

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

    Dif(int base) : base(base), cnt_zero(0), sum_neg(0) {};
    int size() { return pos.size() + neg.size() + cnt_zero; }
    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)
    {
        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)
        {
            dif.base += this->base;
            (*this) = dif;
            return;
        }
        int sz = min(dif.size(), this->size());
        vi tmp;
        for (int i = 1; i <= sz; i++)
            tmp.push_back(this->at(i) + dif.at(i));
        (*this) = Dif(base + dif.base);
        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());
    }
    void print()
    {
        cout << "size = " << this->size() << endl;
        cout << "base = " << base << endl;
        cout << "cnt_zero = " << cnt_zero << endl;
        cout << "sum_neg = " << sum_neg << endl;
        for (int i = 1; i <= this->size(); i++)
            cout << this->at(i) << " ";
        cout << endl;
    }
};

vi G[N];
int ans[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 = Dif(color[u - 1] - '0');
    for (auto v : G[u])
    {
        Dif tmp = solve(v);
        dif.merge(tmp);
    }
    dif.insert(color[u - 1] == '0' ? 1 : -1);
    ans[u] = dif.base + dif.sum_neg;
    // cout << "======================" << endl;
    // cout << "dif of vertex " << u << endl;
    // dif.print();
    // cout << "======================" << endl;
    return dif;
}