#include <bits/stdc++.h>
#define int long long

using namespace std;

void solve () {
    int n;
    cin >> n;

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

    vector <int> hp (n+1);
    for (int i = 1; i <= n; i ++) {
        cin >> hp[i];
    }
    vector dp (2, vector (n + 1, vector <int> (n + 1,1e18)));
    for(int i=1;i<=n;i++){
        // if(g[i].size()==0)
        dp[0][i][0]=hp[i];
        dp[1][i][1]=0;
        // dp[1][i][g[i].size()]=0;
    }
    vector<int>sz(n+1);
    auto treedfs=[&](auto &&self,int u)->void {
        sz[u]=1;
        for(auto v:g[u]){
            self(self,v);
            sz[u]+=sz[v];
        }

    };

    auto dfs=[&](auto &&self,int u)->void {
        
        for(auto v:g[u]){
            self(self,v);
        }
        for(auto v:g[u]){
            for(int i=sz[u];i>=0;i--){
                int minn1=1e18,minn2=1e18;
                for(int j=sz[v];j>=0;j--){
                    if(i-j>=0){
                        minn1=min(minn1,dp[0][u][i-j]+min(dp[1][v][j],dp[0][v][j]+hp[v]));
                        // dp[0][u][i]=dp[0][u][i-j]+dp[1][v][j];

                    }
                    if(i-j>=1)
                        minn2=min(minn2,dp[1][u][i-j]+min(dp[0][v][j],dp[1][v][j]));
                }
                dp[0][u][i]=minn1;

                dp[1][u][i]=minn2;
            }
            //  dp[0][u][0]=dp[0][u][0]+dp[0][v][0]+hp[v];
        }
    };
    treedfs(treedfs,1);
    dfs(dfs,1);
    // cout<<dp[0][1][0];
    for(int i=0;i<=n;i++){
        int ans=1e18;
        // for(int j=0;j<=n;j++){
            ans=min(ans,dp[1][1][i]);
            ans=min(ans,dp[0][1][i]);
        // }
        cout<<ans<<" ";
    }
    cout<<'\n';
}

signed main () {
    ios::sync_with_stdio (false);
    cin.tie (nullptr);

    int T = 1;
    cin >> T;

    while (T --) {
        solve ();
    }

    return 0;
}