//
// Created by 15411 on 2024/10/12.
//
#include<bits/stdc++.h>

#define ll long long
#define int long long
#define endl "\n"
#define Endl "\n"
#define emdl "\n"
#define Emdl "\n"
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
using namespace std;
const int MAX = 2e5 + 7;
const int INF = 1e18 + 7;
struct p {
    double sum;//平均值
    ll val;//总价值
    ll num;//个数
} dp[MAX];
vector<ll> edge[MAX];

bool cmp(p x, p y) {
    return x.sum > y.sum;
}

void dfs(ll u) {
    vector<p> now;
    for (auto v: edge[u]) {
        dfs(v);
        now.push_back(dp[v]);
    }
    sort(now.begin(), now.end(), cmp);
    for (auto nxt: now) {
        ll val = dp[u].val + nxt.val;
        ll num = dp[u].num + nxt.num;
        double sum = 1.0 * val / num;
        if (sum > dp[u].sum) {
            dp[u].num = num;
            dp[u].val = val;
            dp[u].sum = sum;
        }
    }
}

void solve() {
    ll n;
    cin >> n;
    for (ll i = 2; i <= n; i++) {
        ll u;
        cin >> u;
        edge[u].push_back(i);
    }
    for (ll i = 1; i <= n; i++) {
        cin >> dp[i].val;
        dp[i].num = 1;
        dp[i].sum = dp[i].val / dp[i].num;
    }
    dfs(1);
    for (ll i = 1; i <= n; i++) {
        cout << dp[i].sum << endl;
    }
}

signed main() {
    ios::sync_with_stdio(false);//cin.tie(0);cout.tie(0);
    ll t;
    t = 1;
//    cin >> t;
    while (t--)
        solve();
    return 0;
}