#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+5;
int n,fa[N],w[N],mk[N];
vector<int>p[N];
multiset<double>q[N];
double a[N],b[N],rs[N];
void dfs(int x){
	mk[x]=1;
	//f[x]=w[x]-nw;
	q[x].insert(0);
	a[x]=-1;b[x]=w[x];
	for(auto c:p[x]){
		if(mk[c])continue;
		dfs(c);
		for(auto d:q[c])q[x].insert(d);
	//	if(f[c]>0)f[x]+=f[c];
	}
	while(1){
		auto w=*prev(q[x].end());
		if(a[x]*w+b[x]<0){
			q[x].erase(--q[x].end());
			double y=a[x]*w+b[x];
			a[x]--;
			b[x]=y-a[x]*w;
		}else{
			double y=-b[x]/a[x];
			rs[x]=y;
			for(int i=1;i<=-a[x];i++)q[x].insert(y);
			a[x]=0;b[x]=0;
			break;
		}
	}
	mk[x]=0;
}
signed main(){
	cin>>n;
	for(int i=2;i<=n;i++){
		scanf("%lld",&fa[i]);
		p[fa[i]].push_back(i);
	}
	for(int i=1;i<=n;i++)scanf("%lld",&w[i]);
	dfs(1);
	for(int i=1;i<=n;i++)printf("%.10lf\n",rs[i]);
}