#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return x*f;
}
int n,fa[N],c[N];
long long w[N];
bool vis[N];
long double ans[N];
struct node{
	long long sum;
	int num,id;
	inline bool operator<(const node b)const{
		if((__int128)sum*b.num != (__int128)b.sum*num)return (__int128)sum*b.num<(__int128)b.sum*num;
		return id<b.id;
	}
};
priority_queue<node>q;
int main(){
	n=read();
	for(int i = 2;i<=n;i++)fa[i]=read();
	for(int i = 1;i<=n;i++)w[i]=read(),q.push({w[i],1,i}),c[i]=1;
	while(q.size()){
		auto [sum,num,id]=q.top();q.pop();
		if(vis[id])continue;
		vis[id]=1;
		ans[id]=(long double)sum/num;
		if(id!=1&&!vis[fa[id]]){
			w[fa[id]]+=w[id],c[fa[id]]+=c[id];
			q.push({w[fa[id]],c[fa[id]],fa[id]});
		}
	}
	for(int i = 1;i<=n;i++)printf("%.7Lf\n",ans[i]);
	return 0;
}