#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
vector<int> e[200005];
double a[200005];
int sz[200005];
struct Node {
	int u, s;
	double w;
};
bool vis[200005];
int p[200005], cti;
void DFS0(int u) {
	p[++cti] = u;
	for (int v : e[u]) DFS0(v);
}
double ans[200005], f[200005];
int rS[200005], bel[200005];
bool inP[200005];
bool isL[200005];
void DFS(int u, double C) {
	vis[u] = true;
	f[u] = rS[u] = 0;
	for (int v : e[u]) {
		if (!inP[v]) continue;
		DFS(v, C);
		if (f[v] >= 0) f[u] += f[v], rS[u] += rS[v];
	}
	f[u] += a[u], rS[u] += sz[u];
	if (f[u] >= 0) isL[u] = true;
	else isL[u] = false;
}
void Solve(const vector<Node> &p, const vector<pair<int, int>> &cE, double l, double r) {
	if (!p.size()) return;
	if (r - l < 1e-6) {
		for (auto x : p) ans[x.u] = l;
		return;
	}
	double C = (l + r) / 2;
	for (auto x : p) inP[x.u] = true;
	for (auto x : p) a[x.u] = x.w + x.s * C, sz[x.u] = x.s;
	for (auto [x, y] : cE) e[x].push_back(y);
	for (auto x : p) if (!vis[x.u]) DFS(x.u, C);
	vector<Node> pl, pr;
	for (auto x : p) {
		if (isL[x.u]) pl.push_back({ x.u, x.s, x.w });
		else pr.push_back({ x.u, rS[x.u], f[x.u] - C * rS[x.u] });
	}
	for (auto x : p) inP[x.u] = false;
	for (auto x : p) vis[x.u] = false;
	vector<pair<int, int>> eL, eR;
	for (auto x : p) bel[x.u] = x.u;
	for (auto x : p) {
		int u = x.u;
		for (int v : e[u]) {
			if (f[v] >= 0) bel[v] = bel[u];
		}
	}
	for (auto [x, y] : cE) {
		if (isL[x] && isL[y]) eL.push_back({ x, y });
		if (isL[x] && !isL[y]) eR.push_back({ bel[x], y });
		if (!isL[x] && isL[y]) ;
		if (!isL[x] && !isL[y]) eR.push_back({ x, y });
	}
	for (auto [x, y] : cE) e[x].clear(), e[y].clear();
	Solve(pl, eL, l, C), Solve(pr, eR, C, r);
}
int main() {
	scanf("%d", &n);
	vector<pair<int, int>> cE;
	for (int i = 2, p; i <= n; i++) {
		scanf("%d", &p), cE.push_back({ p, i });
		e[p].push_back(i);
	}
	for (int i = 1; i <= n; i++) scanf("%lf", a + i);
	DFS0(1);
	vector<Node> pt;
	for (int i = 1; i <= n; i++) pt.push_back({ p[i], 1, a[p[i]] }), e[i].clear();
	Solve(pt, cE, -1e9, 0);
	for (int i = 1; i <= n; i++) printf("%.10lf\n", -ans[i]);
	return 0;
}