#include <bits/stdc++.h>
#define db long double
#define int long long
using namespace std;
const int N = 200200;
int n;
int fa[N], w[N];
int f[N];
int find(int x) {
    if (x == f[x]) return x;
    return f[x] = find(f[x]);
}
#define pdi pair<db, int>
priority_queue<pdi> pq;
int g[N], s[N];
signed main() {
    scanf("%lld", &n);
    for (int i = 1; i < n; ++i) scanf("%lld", fa + i + 1);
    for (int i = 1; i <= n; ++i) scanf("%lld", w + i), g[i] = w[i], f[i] = i, s[i] = 1, pq.emplace(w[i], i);
    while (!pq.empty()) {
        int u = pq.top().second, o = find(u); pq.pop();
        if (o == 1 || o != u) continue;
        int l = find(fa[o]);
        s[l] += s[o], g[l] += g[o], f[o] = l, pq.emplace(1.0 * g[l] / s[l], l);
    }
    for (int i = 1; i <= n; ++i) printf("%.6Lf\n", 1.0L * g[i] / s[i]);
    return 0;
}