#include <bits/stdc++.h>
#define ll long long
#define db double
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back
#define pdi pair <db, int> 

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2e5+5;
int n, w[N], mk[N], id[N], a[N]; 
vector <int> e[N]; 
struct frac {
	ll s, c; 
	friend bool operator < (const frac & a, const frac & b) {
		return a.s*b.c < b.s*a.c; 
	}
	friend frac operator + (const frac & a, const frac & b) {
		return (frac){a.s+b.s, a.c+b.c}; 
	}
}f[N];
struct node {
	frac x; int p; 
	friend bool operator < (const node & a, const node & b) {
		return a.x < b.x; 
	}
};
priority_queue <node> q[N]; 
inline void mer (int &x, int &y) {
	if (q[x].size() < q[y].size()) swap(x, y);
	while (q[y].size()) q[x].push(q[y].top()), q[y].pop(); 
}

void dfs (int p) {
	f[p] = (frac){a[p], 1}; id[p] = p; 
	for (int i : e[p]) {
		dfs(i); q[p].push((node){f[i], i}); 
	}
	while (q[id[p]].size() && f[p] < q[id[p]].top().x) {
		node t = q[id[p]].top(); q[id[p]].pop(); 
		f[p] = f[p]+t.x; mer(id[p], id[t.p]); 
	}
}

void solve () {
	cin >> n; 
	for (int i = 2;i <= n;i++) {
		int p; cin >> p; 
		e[p].pb(i); 
	}
	for (int i = 1;i <= n;i++) cin >> a[i]; 
	dfs(1); 
	for (int i = 1;i <= n;i++) printf("%.20lf\n", 1.0*f[i].s/f[i].c); 
}

signed main () {
	int T = 1; 
	while (T--) solve();
	return 0;
}