#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <iostream>
#include <vector>
#include <queue>
#include <ctime>
#include <cassert>

using namespace std;

#define int long long
#define For(i, l, r) for(int i = l; i <= r; i ++)
#define Rep(i, l, r) for(int i = l; i >= r; i --)

bool START;

void in(int &x)
{
	char c = getchar(); int op = 1;
	while(c > '9' || c < '0') op *= (c == '-' ? -1 : 1), c = getchar();
	for(x = 0; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - '0'; x *= op;
}

const int N = 2e5 + 50;

int n, m, a[N], sz[N], f[N];
struct PII
{
	int x, y;
	int val() {double u = x; u = u * n * n / y; return (int)u;}
};
vector<int> G[N];
bool operator < (PII a, PII b) {return a.val() < b.val();}
priority_queue<PII> q[N];


void dfs(int u, int pa)
{
	sz[u] = 1; f[u] = a[u];
	for(int v : G[u]) if(v != pa)
	{
		dfs(v, u);
		if(q[u].size() < q[v].size()) swap(q[u], q[v]);
		while(q[v].size()) q[u].push(q[v].top()), q[v].pop();
	}
	while(q[u].size() && f[u] * q[u].top().y <= sz[u] * q[u].top().x)
	{
		f[u] += q[u].top().x; sz[u] += q[u].top().y; q[u].pop();
	}
	q[u].push({f[u], sz[u]});
}

bool ENDPOS = 0;
signed main()
{
	double BeginTime = clock();
	in(n); For(i, 2, n)
	{
		int x; in(x); G[x].push_back(i);
	}
	For(i, 1, n) in(a[i]);
	dfs(1, 0);
	For(i, 1, n)
	{
		printf("%.8lf\n", 1.0 * f[i] / sz[i]);
	}
	cerr << "Time = " << (clock() - BeginTime) * 1.0 / CLOCKS_PER_SEC << " s" << endl;
	cerr << "Memory = " << (&ENDPOS - &START) * 1.0 / 1024 / 1024 << " Mib" << endl;
	return 0;
}