#include<bits/stdc++.h>

#define ll long long
using namespace std;
const ll MAX = 2e5 + 7;
ll fa[MAX];//原本的父节点
ll f[MAX];//并查集父节点
struct p {
    ll siz;
    ll val;
    ll num;
} dp[MAX];

struct cmp {
    bool operator()(const p &a, const p &b) {
        return a.val * b.siz < b.val * a.siz;//降序排列
    }
};

std::priority_queue<p, vector<p>, cmp> q;
bool vis[MAX] = {false};
double fp[MAX];

void solve() {
    ll n;
    cin >> n;
    fa[1] = 1;
    f[1] = 1;
    for (ll i = 2; i <= n; i++) {
        ll u;
        cin >> u;
        fa[i] = u;
        f[i] = i;
    }
    for (ll i = 1; i <= n; i++) {
        cin >> dp[i].val;
        dp[i].siz = 1;
        dp[i].num = i;
        q.push(dp[i]);
    }
    while (!q.empty()) {
        p now = q.top();
        q.pop();
        if (vis[now.num])continue;
        vis[now.num] = true;
        fp[now.num] = 1.0 * now.val / now.siz;
        ll nxt = f[fa[now.num]];
        f[now.num] = nxt;
        if (!vis[nxt]) {
            dp[nxt].val += now.val;
            dp[nxt].siz += now.siz;
            q.push(dp[nxt]);
        }
    }
    for (ll i = 1; i <= n; i++) {
        cout << fp[i] << 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;
}