#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pii pair<int,int>
#define fi first
#define se second
#define mems(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define db double
using namespace std;
const int maxn=200010;
const int inf=1e18;
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;
}
bool Mbe;

int n,fa[maxn];
db a[maxn];
int num[maxn],f[maxn];
int fd(int x){
	if(f[x]==x)return x;
	return f[x]=fd(f[x]);
}
priority_queue<pair<db,int>> q;
bool vis[maxn];
void work(){
	n=read();
	for(int i=2;i<=n;i++)fa[i]=read();
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=n;i++)num[i]=1,f[i]=i,q.push({a[i],i});
	while(!q.empty()){
		int u=q.top().se;q.pop();
		if(vis[u])continue;vis[u]=1;
		if(u==1)continue;
		int tp=fd(fa[u]);
		if(a[u]>a[tp]){
			if((a[tp]*num[tp]+a[u]*num[u])*num[tp]>a[tp]*(num[tp]+num[u])){
				a[tp]=1.0*(a[tp]*num[tp]+a[u]*num[u])/(num[tp]+num[u]);
				num[tp]+=num[u];
				q.push({a[tp],tp});
			}
		}
	}
	for(int i=1;i<=n;i++)printf("%.10lf\n",a[i]);
}

// \
444

bool Med;
int T;
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	
//	ios::sync_with_stdio(0);
//	cin.tie(0);cout.tie(0);
	
//	cerr<<(&Mbe-&Med)/1048576.0<<" MB\n";
	
	T=1;
	while(T--)work();
}