// Hydro submission #672b5ec2a05967896663a54e@1730895555457
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
typedef pair <double, int> PDI;
priority_queue <PDI> q;
int f[N], fa[N], siz[N];
long long a[N];
double ans[N];
bool vis[N];
int read()
{
    int r = 0, c = getchar(), f = 1;
    while (!isdigit(c))
    {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (isdigit(c)) r = (r << 1) + (r << 3) + (c ^ 48), c = getchar();
    return r * f;
}
int find(int x)
{
    while (x != f[x]) x = f[x] = f[f[x]];
    return x;
}
int main()
{
    int n = read();
    for (int i = 2; i <= n; ++i) fa[i] = read();
    for (int i = 1; i <= n; ++i) a[i] = read(), siz[i] = 1, f[i] = i, q.push({a[i], i});
    while (!q.empty())
    {
        int x = q.top().second;
        q.pop();
        if (vis[x]) continue;
        vis[x] = 1;
        ans[x] = a[x] * 1.0 / siz[x];
        if (fa[x]) 
        {
            int fat = find(fa[x]);
            if (a[fat] * 1.0 / siz[fat] <= a[x] * 1.0 / siz[x])
            {
                a[fat] += a[x];
                siz[fat] += siz[x];
                f[x] = fa[x];
                q.push({a[fat] * 1.0 / siz[fat], a[fat]});
            }
        }
    }
    for (int i = 1; i <= n; ++i) printf("%.7lf\n", ans[i]);
    return 0;
}