#include <bits/stdc++.h>
using namespace std;
vector<int>g[2005];
long long a[2005],dp[2005][2005][2],tmp[2005][2];
int n;
int sz[2005];
void dfs(int u,int f){
	dp[u][0][0]=a[u];
	dp[u][1][1]=0;
	sz[u]=1;
	for(int v:g[u]){
		dfs(v,u);
		for(int i=0;i<=n;i++){
			tmp[i][0]=tmp[i][1]=1e9;
		}
		sz[u]+=sz[v];
		for(int i=sz[u];~i;i--){
			for(int j=min(i,sz[v]);~j;j--){
				tmp[i][0]=min(tmp[i][0],dp[v][j][1]+dp[u][i-j][0]);
				tmp[i][0]=min(tmp[i][0],dp[v][j][0]+dp[u][i-j][0]+a[v]);
				tmp[i][1]=min(tmp[i][1],dp[v][j][1]+dp[u][i-j][1]);
				tmp[i][1]=min(tmp[i][1],dp[v][j][0]+dp[u][i-j][1]);
			}
		}
		for(int i=0;i<=sz[u];i++)dp[u][i][0]=tmp[i][0],dp[u][i][1]=tmp[i][1];
	}
}
int main(){
	int T;
	cin>>T;
	while(T--){
		cin>>n;
		for(int i=1;i<=n;i++)g[i].clear();
		for(int i=2;i<=n;i++){
			int f;
			cin>>f;
			g[f].push_back(i);
		}
		for(int i=1;i<=n;i++)cin>>a[i];
		for(int i=1;i<=n;i++)for(int j=0;j<=n;j++)dp[i][j][0]=dp[i][j][1]=1e9;
		dfs(1,0);
		for(int i=0;i<=n;i++)cout<<min(dp[1][i][0],dp[1][i][1])<<(i!=n?' ':'\n');
	}
}
/*
things to check
0.delete cerr code or use '//'
1.initallize(especially multicases)
2.int overflow/long long mle
3.if make the ans is hard , try 2-divided
4.memory &b-&a
5.function canshu position
6.the format of input
7.size enough ?
8.the name of function
9.stop copying x0->y0
*/