#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef __int128 i128;
const int maxn = 2e5 + 5;

struct node
{
    ll x; int y;
    bool operator < (const node &b)const { return (i128)x * b.y > (i128)b.x * y; }
    node operator + (const node &b)const { return (node){x + b.x, y + b.y}; }
};

ll w[maxn];
vector<int> g[maxn];
long double ans[maxn];

struct tr
{
    int ls, rs, dis;
    node val;
}t[maxn];
int rt[maxn];

inline int findfa(int x) { return x == rt[x] ? x : rt[x] = findfa(rt[x]); }
int merge(int a, int b)
{
    if (!a || !b) return a ^ b;
    if (!(t[a].val < t[b].val)) swap(a, b);
    t[a].rs = merge(t[a].rs, b);
    if (t[t[a].rs].dis > t[t[a].ls].dis) swap(t[a].ls, t[a].rs);
    t[a].dis = t[t[a].rs].dis + 1;
    return a;
}

void dfs(int u)
{
    int nw = 0; node tmp = (node){w[u], 1};
    for (int v : g[u]) dfs(v), nw = merge(nw, findfa(v));
    while (nw && !(tmp < t[nw].val))
    {
        tmp = tmp + t[nw].val;
        nw = rt[t[nw].ls] = rt[t[nw].rs] = merge(t[nw].ls, t[nw].rs);
    }
    ans[u] = 1.0 * tmp.x / tmp.y;
    t[u].val = tmp, rt[u] = merge(nw, u);
}

int main()
{
	ios::sync_with_stdio(false), cin.tie(0);
	
	int n;
    cin >> n;
    for (int i = 2; i <= n; i++)
    {
        int x; cin >> x;
        g[x].emplace_back(i);
    }
    for (int i = 1; i <= n; i++) cin >> w[i];
    dfs(1); cout.precision(10);
    for (int i = 1; i <= n; i++) cout << ans[i] << "\n";
	return 0;
}