// sis puella oier
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
ll read(){
    ll xx = 0, f = 1; char ch = getchar();
    for (;!isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (; isdigit(ch); ch = getchar())
        xx = (xx << 3) + (xx << 1) + ch - '0';
    return xx * f;
}
const int N = 2010, inf = 1e16;
int n, a[N], siz[N], f[N][2][N], g[N];
vector <int> e[N];
void dfs(int x){
    siz[x] = 1; f[x][0][0] = a[x], f[x][0][1] = 0;
    f[x][1][0] = inf, f[x][1][1] = 0;
    for (int v : e[x]){
        dfs(v);
        for (int l = 0; l <= 1; ++l){
            for (int i = 0; i <= siz[x] + siz[v]; ++i)g[i] = inf;
            for (int r = 0; r <= 1; ++r){
                for (int i = 0; i <= siz[x]; ++i)if (f[x][l][i] != inf)
                for (int j = 0; j <= siz[v]; ++j)if (f[v][r][j] != inf){
                    int val = f[x][l][i] + f[v][r][j];
                    if (l == 0 && r == 0)val += a[v];
                    if (g[i + j] > val)g[i + j] = val;
                }
            }
            for (int i = 0; i <= siz[x] + siz[v]; ++i)f[x][l][i] = g[i];
        }
        siz[x] += siz[v];
    }
}
void solve(){
    n = read(); for (int i = 1; i <= n; ++i)e[i].clear();
    for (int i = 2; i <= n; ++i)e[read()].push_back(i);
    for (int i = 1; i <= n; ++i)a[i] = read();
    dfs(1);
    for (int i = 0; i <= n; ++i)printf("%lld ", min(f[1][0][i], f[1][1][i]));
    printf("\n");
}
signed main(){
    int _ = read();
    while(_--)solve();
    return 0;
}