#include<bits/stdc++.h>
#define ll long long

using namespace std;

const int N = 2e3 + 10;
const ll INF = 1e18;
vector<int>e[N];
ll dp[N][N][2], a[N], t[N];
int n;

void dfs(int u)
{
    for (int i = 0; i <= n; i++)dp[u][i][0] = dp[u][i][1] = INF;
    dp[u][1][0] = 0, dp[u][0][1] = a[u];
    for (auto v : e[u])
    {
        dfs(v);
        for (int i = 0; i <= n; i++)t[i] = dp[u][i][0], dp[u][i][0] = INF;
        for (int i = 0; i <= n; i++)
            for (int j = 0; j + i <= n; j++)
                dp[u][i + j][0] = min(dp[u][i + j][0], t[i] + min(dp[v][j][0], dp[v][j][1]));
        for (int i = 0; i <= n; i++)t[i] = dp[u][i][1], dp[u][i][1] = INF;
        for (int i = 0; i <= n; i++)
            for (int j = 0; j + i <= n; j++)
                dp[u][i + j][1] = min(dp[u][i + j][1], t[i] + min(dp[v][j][0], dp[v][j][1] + a[v]));
    }
}

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)e[i].clear();
    for (int i = 2; i <= n; i++)
    {
        int p; cin >> p;
        e[p].push_back(i);
    }
    for (int i = 1; i <= n; i++)cin >> a[i];
    dfs(1);
    for (int i = 0; i <= n; i++)cout << min(dp[1][i][0], dp[1][i][1]) << ' ';
    cout << '\n';
}

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