#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 3e3 + 9;
const int mod = 1e9 + 7;
#define eps 1e-5
#define inf 1e18

ll f[N][N][2];
ll hp[N],p[N];
ll n;
vector<int> g[N];
int sz[N];

void dfs(int x)
{
	f[x][0][0] = 0;
	f[x][1][1] = hp[x];
	sz[x] = 0;

	for(auto &y:g[x])
	{
		dfs(y);

		for(int i = sz[x]; i >= 0;-- i) 
			for(int j = sz[y]; j >= 0; -- j)
			{
				f[x][i + j][1] = min(f[x][i + j][1], f[x][i][1] + min(f[y][j][0], f[y][j][1] + hp[y]));//拿根-->拿儿子时加上儿子权值
				f[x][i + j][0] = min(f[x][i + j][0], f[x][i][0] + min(f[y][j][0], f[y][j][1]));
			}

		sz[x] += sz[y];
	} 

}

void solve()
{
    cin>>n;
	for(int i = 1;i <= n; ++ i) g[i].clear(); 

	for(int i = 1;i <= n; ++ i) 
		for(int j = 0;j <= n; ++ j) f[i][j][1] = f[i][j][0] = inf;

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

	dfs(1);

	for(int i = n;i >= 0; -- i)
	{
		cout<< min(f[1][i][1],f[1][i][0]) <<' ';
	}
	cout<<'\n';
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;  cin>>_;
    while (_--) solve();
    return 0;
}