#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,p[N],sz[N],fa[N];
long double w[N],ans[N];
int gf(int x){
	return fa[x]==x?fa[x]:fa[x]=gf(fa[x]);
}
int main(){
	scanf("%d",&n);
	for(int i=2;i<=n;++i)scanf("%d",&p[i]);
	for(int i=1;i<=n;++i)scanf("%Lf",&w[i]);
	priority_queue<pair<long double,int>>q;
	for(int i=1;i<=n;++i)q.emplace(w[i],i),fa[i]=i,sz[i]=1;
	while(!q.empty()){
		int u=q.top().second;
		q.pop();
		if(fa[u]!=u)continue;
		ans[u]=w[u]/sz[u];
		int x=fa[u]=gf(p[u]);
		if(!x)continue;
		w[x]+=w[u];
		sz[x]+=sz[u];
		q.emplace(w[x]/sz[x],x);
	}
	for(int i=1;i<=n;++i)printf("%Lf\n",ans[i]);
	return 0;
}