#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using pi=pair<int,int>;
#define fi first
#define se second
const int N=2e5+5;
int n,sz[N],fa[N],Fa[N];
double val[N],ans[N];
bool vis[N];
priority_queue<pair<double,int>>q;
int gf(int x){return x==fa[x]?x:fa[x]=gf(fa[x]);}
int main() {
    #ifndef ONLINE_JUDGE
        freopen(".in","r",stdin);
        freopen(".out","w",stdout);
    #endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cout<<fixed<<setprecision(7);    
    cin>>n;
    for(int i=2;i<=n;i++)cin>>Fa[i];
    for(int i=1,x;i<=n;i++)cin>>x,val[i]=x,sz[i]=1,q.push({val[i],i});
    iota(fa+1,fa+n+1,1);
    while(q.size()>1) {
        pair<double,int>u=q.top();q.pop();
        int x=u.se,p=gf(Fa[u.se]);
        if(vis[x])continue;
        ans[x]=u.fi,vis[x]=1;
        if(p&&val[x]>val[p]) {
            val[p]=(val[p]*sz[p]+val[x]*sz[x])/(sz[x]+sz[p]);
            fa[x]=p,sz[p]+=sz[x],q.push({val[p],p});
        }
    }
    for(int i=1;i<=n;i++)cout<<ans[i]<<'\n';
	return 0;
}