#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define MAXN 2010
ll hd[MAXN],ed[MAXN*2],nxt[MAXN*2];
ll dp[MAXN][2][MAXN][2],val[MAXN],siz[MAXN],cnt[MAXN];
ll n,idx,T;
inline ll read(){
    ll x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){
        if(c=='-')f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9'){
        x=x*10+c-'0';
        c=getchar();
    }
    return x*f;
} 
void build(ll x,ll y){
    nxt[++idx]=hd[x];
    hd[x]=idx;
    ed[idx]=y;
}
void dfs(ll now){
//    cout<<now<<endl;
    dp[now][1][1][0]=0,dp[now][0][0][0]=val[now];
    siz[now]=1;
    cnt[now]=0;
    for(int i=hd[now];i;i=nxt[i]){
        ll y=ed[i];
        dfs(y);
        cnt[now]++;
        siz[now]+=siz[y];
        for(int p=0;p<=1;p++){
            for(int j=p;j<=siz[now]-1+p;j++){
                dp[now][p][j][cnt[now]%2]=10000000000000;
                for(int q=0;q<=1;q++){
                    for(int u=q;u<=min(siz[y]+q-1,j-p);u++){
//                        cout<<now<<" "<<p<<" "<<j<<" "<<q<<" "<<u<<endl;
                        dp[now][p][j][cnt[now]%2]=min(dp[now][p][j][cnt[now]%2],dp[y][q][u][cnt[y]%2]+dp[now][p][j-u][(cnt[now]-1)%2]+((q|p)?0:val[y]));
//                        cout<<now<<" "<<p<<" "<<j<<" "<<q<<" "<<u<<" "<<dp[now][p][j][cnt[now]%2]<<" "<<dp[y][q][u][cnt[y]%2]<<" "<<dp[now][p][j-u][(cnt[now]-1)%2]<<endl;
                    }
                }
//                cout<<now<<" "<<p<<" "<<j<<" "<<dp[now][p][j][cnt[now]%2]<<endl;
            }
        }
    }
}
void clear(){
//    memset(dp,125,sizeof(dp));
//    memset(siz,0,sizeof(siz));
//    memset(cnt,0,sizeof(cnt));
    memset(hd,0,sizeof(hd));
    memset(ed,0,sizeof(ed));
    memset(nxt,0,sizeof(nxt));
    idx=0;
}
signed main(){
    T=read();
    while(T--){
        n=read();
        clear();
        for(int i=1;i<n;i++){
            ll p=read();
            build(p,i+1);
        } 
        for(int i=1;i<=n;i++)val[i]=read();
        dfs(1);
        for(int i=0;i<=n;i++){
            if(!i)cout<<dp[1][0][0][cnt[1]%2]<<" ";
            else if(i==n)cout<<"0\n";
            else cout<<min(dp[1][1][i][cnt[1]%2],dp[1][0][i][cnt[1]%2])<<" "; 
        }
        cout<<endl;
    }
    return 0;
}