#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=2e5+5;
int n;
int fa[N];
int f[N];
ll w[N],si[N];
double ans[N];
struct node{
    ll w,si;
    int id;
    node()=default;
    node(ll w,ll si,int id):w(w),si(si),id(id){}
    bool operator<(const node& ls)const{
        return w*ls.si<ls.w*si;
    }
};
priority_queue<node> q;
int find(int x){return f[x]==x?x:f[x]=find(f[x]);}
int main(){
    cin>>n;
    for(int i=2;i<=n;++i)cin>>fa[i];
    for(int i=1;i<=n;++i){
        f[i]=i;
        cin>>w[i];
        si[i]=1;
        q.emplace(w[i],1,i);
    }
    while(!q.empty()){
        auto it=q.top();
        q.pop();
        if(it.w!=w[it.id])continue;
        ans[it.id]=1.0*it.w/it.si;
        int to=find(fa[it.id]);
        if(!to)continue;
        f[it.id]=to;
        w[to]+=it.w;
        si[to]+=it.si;
        q.emplace(w[to],si[to],to);
    }
    for(int i=1;i<=n;++i)printf("%.10f\n",ans[i]);
    return 0;
}