#include<bits/stdc++.h>
using namespace std;
// #pragma GCC optimize(3)
#define int long long

// std::mt19937_64 rng {std::chrono::steady_clock::now().time_since_epoch().count()};

int n;
string s;

inline void solve(){
    cin>>n;

    cin>>s;
    s=" "+s;    

    vector<vector<int> >g(n+1);
    for(int i=2,p;i<=n;i++){
        cin>>p;
        g[p].push_back(i);
    }

    vector<int>dep(n+1),mn(n+1,1e9);
    auto pre=[&](auto self,int u,int fa)->void {
        dep[u]=dep[fa]+1;
        if(g[u].empty()){
            mn[u]=dep[u];
            return;
        }
        for(auto t:g[u]){
            self(self,t,u);
            mn[u]=min(mn[u],mn[t]);
        }
    };
    pre(pre,1,0);

    vector<int>ans(n+1,1e9);
    vector<vector<int> >dp(n+1,vector<int>(n+1));
    auto dfs=[&](auto self,int u)->void {
        if(g[u].empty()){
            dp[u][0]=(s[u]=='1');
            dp[u][1]=(s[u]=='0');
            ans[u]=0;
            return;
        }
        for(auto t:g[u]){
            self(self,t);
            for(int i=0;i<=mn[u]-dep[u]+1;i++){
                if(i==0)dp[u][i]+=dp[t][i]+(s[u]=='1');
                else if(i==mn[u]-dep[u]+1)dp[u][i]+=dp[t][i-1]+(s[u]=='0');
                else dp[u][i]+=min(dp[t][i]+(s[u]=='1'),dp[t][i-1]+(s[u]=='0'));
            }
        }
        for(int i=0;i<=mn[u]-dep[u]+1;i++)ans[u]=min(ans[u],dp[u][i]);
        
    };
    dfs(dfs,1);

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

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    // cout<<setiosflags(ios::fixed)<<setprecision(10);

    int _=1;
    cin>>_;
    while(_--){
        solve();
    }
    return 0;
}