#include<bits/stdc++.h>
# define int long long
# define rep(i, j, k) for (int i = j; i <= k; ++i)
# define N 200005
using namespace std;

int n, p[N], w[N], sum[N], sz[N], ok[N], id[N];
double ans[N];
int root(int x){return id[x] == x ? x : id[x] = root(id[x]);}
struct node
{
	int u, sum, sz;
	bool operator<(const node &x)const{return (__int128) sum * x.sz < (__int128) x.sum * sz;}
};
priority_queue < node > q;

signed main()
{
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	cin >> n;
	rep(i, 2, n) cin >> p[i];
	rep(i, 1, n) cin >> w[i], sum[i] = w[i], sz[i] = 1, q.push({i, w[i], sz[i]}), id[i] = i;
	while (!q.empty())
	{
		node x = q.top(); q.pop();
		if (ok[x.u]) continue; ok[x.u] = 1;
		ans[x.u] = 1.0 * x.sum / x.sz;
		id[x.u] = p[x.u];
		int rt = root(x.u); if (rt) q.push({rt, sum[rt] += sum[x.u], sz[rt] += sz[x.u]});
	}
	rep(i, 1, n) cout << fixed << setprecision(15) << ans[i] << '\n';
	return 0;
}