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

const int maxN = 100005;

struct graph{
    long long a, b;
    priority_queue <long long> *pq;

    graph operator+(graph aux){
        graph sum;

        sum.a = a + aux.a;
        sum.b = b + aux.b;

        if(pq->size() < aux.pq->size()){
            sum.pq = aux.pq;

            while(!pq->empty()){
                sum.pq->push(pq->top());
                pq->pop();
            }
        }
        else{
            sum.pq = pq;

            while(!aux.pq->empty()){
                sum.pq->push(aux.pq->top());
                aux.pq->pop();
            }
        }

        return sum;
    }
};
graph d[maxN];

int n;
int P[maxN], C[maxN], ans[maxN];


void solve() {
    cin >> n;
    vector <bool> frunza(n + 1, 1);
    vector <graph> d(n + 1);
    vector <int> P(n + 1), C(n + 1), ans(n + 1, 0);
    string str;
    cin >> str;
    for (int i = 1; i <= n; i++) {
        C[i] = str[i - 1] - '0';
    }
    for (int i = 2; i <= n; i++) {
        cin >> P[i];
        frunza[P[i]] = 0;
    }
    for (int i = 1; i <= n; i++) {
        d[i].pq = new priority_queue <long long>;
    }
    for(int i = n; i > 1 ; --i){
        if (frunza[i]) {
            d[i].a = 1; d[i].b = -C[i];

            d[i].pq->push(C[i]);
            d[i].pq->push(C[i]);

            d[P[i]] = d[P[i]] + d[i];
            continue;
        }
        while(d[i].a > 1){
            --d[i].a;
            d[i].b += d[i].pq->top();
            d[i].pq->pop();
        }
        ans[i] = d[i].b + d[i].pq->top();
        long long x, y;
        x = d[i].pq->top();
        d[i].pq->pop();
        y = d[i].pq->top();
        d[i].pq->pop();

        d[i].pq->push(x + C[i]);
        d[i].pq->push(y + C[i]);

        d[i].b -= C[i];

        d[P[i]] = d[P[i]] + d[i];
    }
    while(d[1].a > 0){
        --d[1].a;
        d[1].b += d[1].pq->top();
        d[1].pq->pop();
    }
    ans[1] = d[1].b;
    for (int i = 1; i <= n; i++) {
        cout << ans[i];
        if (i != n) {
            cout << ' ';
        }
    }
    cout << '\n';
}

int main() {
    #ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);

  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }

  return 0;
}