#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define uint unsigned
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 200100;

ll n, a[maxn], b[maxn], fa[maxn], p[maxn];
db ans[maxn];
vector<int> G[maxn];

struct frac {
	ll x, y;
	frac(ll a = 0, ll b = 1) : x(a), y(b) {}
};

inline bool operator < (const frac &a, const frac &b) {
	return a.x * b.y < a.y * b.x;
}

struct node {
	int u;
	frac x;
};

inline bool operator < (const node &a, const node &b) {
	return a.x < b.x;
}

int find(int x) {
	return fa[x] == x ? x : fa[x] = find(fa[x]);
}

void solve() {
	scanf("%lld", &n);
	for (int i = 2; i <= n; ++i) {
		scanf("%lld", &p[i]);
	}
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", &a[i]);
		fa[i] = i;
	}
	priority_queue<node> pq;
	for (int i = 1; i <= n; ++i) {
		node u;
		u.u = i;
		u.x = frac(a[i], 1);
		pq.push(u);
		b[i] = 1;
	}
	while (pq.size()) {
		node u = pq.top();
		pq.pop();
		if (a[u.u] != u.x.x || b[u.u] != u.x.y) {
			continue;
		}
		ans[u.u] = 1. * u.x.x / u.x.y;
		if (u.u == 1) {
			continue;
		}
		int x = find(p[u.u]);
		a[x] += u.x.x;
		b[x] += u.x.y;
		fa[u.u] = x;
		node v;
		v.u = x;
		v.x = frac(a[x], b[x]);
		pq.push(v);
	}
	for (int i = 1; i <= n; ++i) {
		printf("%.9lf\n", ans[i]);
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}