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

void solve(){
    int n;
    cin>>n;
    vector<int> edge[n+1],fa(n+1);
    vector<i64> hp(n+1),g(n+1),ans1(n+1);
    vector<bool> vis(n+1);
    for(int i=2;i<=n;i++){
        int u;
        cin>>u;
        edge[u].push_back(i);
        fa[i]=u;
    }
    fa[1]=0;
    vis[0]=true;
    for(int i=1;i<=n;i++){
        cin>>hp[i];
    }

    auto h=g,ans2=ans1;
    function<void(int)> dfs=[&](int u){
        for(auto x:edge[u]){
            dfs(x);
            g[u]+=hp[x];
        }
        ans1[0]+=hp[u]+g[u];
    };
    dfs(1);

    for(int i=1;i<=n;i++){
        i64 res=0,v=0;
        for(int j=1;j<=n;j++){
            if(vis[j]) continue;
            if(res<(vis[fa[j]]?1LL:2LL)*hp[j]+g[j]){
                res=(vis[fa[j]]?1LL:2LL)*hp[j]+g[j];
                v=j;
            }
        }
        // cout<<i <<' '<<v<<'\n';
        ans1[i]=ans1[i-1]-res;
        vis[v]=true;
        g[fa[v]]-=hp[v];
        // if(i==8){
        //     for(int j=1;j<=n;j++){
        //         if(!vis[j]) cout<<j<<' ';
        //     }
        //     cout<<'\n';
        // }
    }
    vis.assign(n+1,false);
    ans2[n]=0;
    for(int i=n-1;i>=0;i--){
        i64 res=1e18,v=0;
        for(int j=1;j<=n;j++){
            if(vis[j]) continue;
            if(res>(vis[fa[j]]?2LL:1LL)*hp[j]+h[j]){
                res=(vis[fa[j]]?2LL:1LL)*hp[j]+h[j];
                v=j;
            }
        }
        ans2[i]=ans2[i+1]+res;
        vis[v]=true;
        h[fa[v]]+=hp[v];
    }
    
    for(int i=0;i<=n;i++){
        cout<<min(ans1[i],ans2[i])<<" \n"[i==n];
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}