#include <bits/stdc++.h>

using namespace std;
using i64 = long long;
int n;
const int N = 200010;
int fa[N];

struct node {
    int x;//id
    i64 y, z;//sum,siz

    friend bool operator<(node i, node j) {
        return i.y * j.z < j.y * i.z;
        //比较平均值
    }
} a[N];

int p[N];
long double ans[N];

int ge(int x) {
    if (x == fa[x])return x;
    else return fa[x] = ge(fa[x]);
}

i64 sum[N], siz[N], del[N];

signed main() {
    cin >> n;
    priority_queue<node> q;
    for (int i = 2; i <= n; i++) {
        cin >> p[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> sum[i];
        siz[i] = 1;

        q.push({i, sum[i], siz[i]});
    }
    while (!q.empty()) {
        node now = q.top();
        q.pop();
        if (sum[now.x] == 0 || siz[now.x] == 0) continue;

        ans[now.x] = (long double) now.y / now.z;
        if (now.x != 1) {//x存在父亲
            int y = ge(p[now.x]);
            sum[y] += sum[now.x];
            siz[y] += siz[now.x];
            fa[now.x] = y;
            q.push({y, sum[y], siz[y]});
        }
        sum[now.x] = 0, siz[now.x] = 0;
    }
    for (int i = 1; i <= n; i++) {
        cout << fixed << setprecision(10) << ans[i] << '\n';
    }
}