#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define scanf scanf_s
#define umap unordered_map
#define lowbit(x) (x&(-x))
#define ls (p<<1)
#define rs (p<<1|1)
//#define int long long
//---------------------
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll INF = 1e18 + 10;
const int inf = 1e9 + 10;
int mod = 998244353;
//---------------------
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
ll qpow(ll a, ll b) { ll ans = 1; while (b) { if (b & 1)ans = ans * a % mod; a = a * a % mod; b >>= 1; }return ans; }
ll inv(ll x) { return qpow(x % mod, mod - 2); }
int d4[4][2] = { {0,1},{1,0},{0,-1},{-1,0} };
int d8[8][2] = { {0,1},{0,-1},{-1,0},{1,0},{1,1},{1,-1},{-1,1},{-1,-1} };

void solve() {
    int n; cin >> n;
    vector<vector<int>>g(n + 1, vector<int>());
    for (int i = 2; i <= n; i++) {
        int x; cin >> x;
        g[x].push_back(i);
    }
    vector<int>a(n + 1);
    for (int i = 1; i <= n; i++)cin >> a[i];

    vector<vector<vector<ll>>>dp(n + 1, vector<vector<ll>>(n + 1, vector<ll>(2, INF)));
    //u的子树总共打死了i只怪物，且包不包括节点u

    vector<int>siz(n + 1);
    auto dfs = [&](auto slef, int u)->void {
        siz[u] = 1;
        dp[u][0][0] = a[u];//没打死
        dp[u][1][1] = 0;//打死了u
        for (int v : g[u]) {
            slef(slef, v);
            for (int i = siz[u]; i >= 0; i--) {
                for (int j = siz[v]; j >= 0; j--) {
                    if (i == 0 && j == 0) {
                        dp[u][i + j][0] = dp[u][i][0] + dp[v][j][0] + a[v];
                    }
                    else if (i == 0) {
                        dp[u][i + j][0] = min(dp[u][i + j][0], dp[u][i][0] + min(dp[v][j][0] + a[v], dp[v][j][1]));
                        dp[u][i + j][1] = min(dp[u][i + j][1], dp[u][i][1] + min(dp[v][j][0] + a[v], dp[v][j][1]));
                    }
                    else if (j == 0) {
                        dp[u][i + j][0] = min(dp[u][i][0], dp[u][i][1]) + dp[v][j][0] + a[v];
                        dp[u][i + j][1] = min(dp[u][i][0], dp[u][i][1]) + dp[v][j][0];
                    }
                    else {
                        dp[u][i + j][0] = min({ dp[u][i + j][0],dp[u][i][0] + min(dp[v][j][1],dp[v][j][0] + a[v]) });
                        dp[u][i + j][1] = min({ dp[u][i + j][1],dp[u][i][1] + min(dp[v][j][0],dp[v][j][1]) });
                    }
                }
            }
            siz[u] += siz[v];
        }
        };
    dfs(dfs, 1);
    for (int i = 0; i <= n; i++) {
        cout << min(dp[1][i][0], dp[1][i][1]) << " \n"[i == n];
    }
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
    cout << fixed << setprecision(12);

    //euler();
    int t = 1; cin >> t;
    for (int i = 1; i <= t; i++) {
        solve();
    }
    return 0;
}