#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];
double f[N],nw;
bool cmp(int a,int b){
	return f[a]>f[b];
}
void dfs(int x){
	mk[x]=1;
	f[x]=w[x]-nw;
	for(auto c:p[x]){
		if(mk[c])continue;
		dfs(c);
		if(f[c]>0)f[x]+=f[c];
	}
	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]);
	for(int i=1;i<=n;i++){
		double l=0,r=1e9;
		for(int j=1;j<=50;j++){
			double mid=(l+r)/2;
			nw=mid;
			dfs(i);
			if(f[i]>=0)l=mid;
			else r=mid;
		}
		printf("%.10lf\n",l);
	}
}