#include <bits/stdc++.h>
using namespace std;
typedef double db;
int n, fa[200010], f[200010], siz[200010];
db a[200010];
bool bk[200010];
int fnd(int x){if(x!=f[x])f[x]=fnd(f[x]);return f[x];}
struct A{
	int id; db x;
	bool operator<(const A u) const{ return x < u.x; }
};
priority_queue<A> q;
int main()
{
	int i, j;
	scanf("%d", &n);
	for(i = 2; i <= n; i++){
		scanf("%d", &fa[i]);
	}
	for(i = 1; i <= n; i++){
		scanf("%lf", &a[i]); f[i] = i; siz[i] = 1;
		q.push({i, a[i]});
	}
	while(q.size() > 0){
		i = q.top().id; q.pop();
		if(bk[i]) continue;
		bk[i] = true;
		if(i > 1){
			j = fnd(fa[i]);
			if(a[i] > a[j]){
				a[j] = (a[i] * siz[i] + a[j] * siz[j]) / (siz[i] + siz[j]);
				siz[j] += siz[i]; fa[i] = j;
				q.push({j, a[j]});
			}
		}
	}
	for(i = 1; i <= n; i++) printf("%.8f\n", a[i]);
	return 0;
}