#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const ll INF=1e18;
ll val[200005];
struct Line{
  ll m,c,pt;
  bool operator<(const Line& l)const{
    if(pt!=l.pt)return pt<l.pt;
    if(m!=l.m)return m<l.m;
    return c<l.c;
  }
};
struct Info{
  multiset<Line>ms;
  void add(ll m, ll c, ll pt){
    if(ms.size()==0){ms.insert({m,c,pt});return;}
    Line lol=*ms.rbegin(); 
    if(lol.pt<pt){ms.insert({m,c,pt});return;}
    lol=*ms.lower_bound({-INF,-INF,pt});
    if(pt!=lol.pt){ms.insert({m,c,pt});return;}
    lol.m+=m; lol.c+=c; 
    ms.insert(lol);
  }
  ll balance(){
    ll m=0,c=0;
    while(ms.size()){
      Line lol=*ms.rbegin(); 
      m+=lol.m,c+=lol.c;
      ms.erase(ms.find(lol));
      ll x;
      if(ms.size()==0){
        x=(-c)/m;
        ms.insert({m,c,x}); return x;
      }
      else{
        Line finale=*ms.rbegin();
        ll x=finale.pt+1;
        if(m*x+c>=0){
          x=(-c)/m;
          ms.insert({m,c,x}); return x;
        }
      }
    }
    Line lol=*ms.rbegin(); return lol.pt;
  }
  ll size(){
    return ms.size();
  }
};
vector<ll>adj[200005];
Info ms[200005];
ll ans[200005];
void merge(ll a, ll b){
  if(ms[a].size()<ms[b].size())swap(ms[a],ms[b]);
  for(auto& k: ms[b].ms){
    ms[a].add(k.m,k.c,k.pt);
  }
}
void dfs(ll s){
  for(auto& u: adj[s]){
    dfs(u);
    merge(s,u);
  }
  ms[s].add(-1,val[s],INF);
  ans[s]=ms[s].balance();
}
int main(){
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  ll n;
  cin>>n;
  for(int i=2;i<=n;i++){
    ll k;
    cin>>k;
    adj[k].push_back(i);
  }
  for(int i=1;i<=n;i++)cin>>val[i];
  for(int i=1;i<=n;i++){
    val[i]*=(10000000LL);
  }
  dfs(1);
  for(int i=1;i<=n;i++){
    ld bruh=ans[i];
    cout<<fixed<<setprecision(10)<<bruh/10000000<<'\n';
  }
}