#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include <bits/stdc++.h>
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define eb emplace_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}
#define si(a) (ll)(a.size())
using namespace std;
using ld = double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pld = pair<ld,ld>;

#define mod 1
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	a = add(a,0);
	b = add(b,0);
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}



const ll maxn = 200005;
ll n;
ll a[maxn];
ll par[maxn];


/**
6
1 2 2 1 4
3 1 5 6 6 7
 */
vector<ll> g[maxn];
ll f[maxn],sz[maxn];
bool cmp(pll a,pll b) {
	return a.fi*b.sc<b.fi*a.sc;
}
void dfs(ll u) {
	f[u] = a[u];
	sz[u] = 1;
	vector<pll> v;
	for(ll s : g[u]) {
		dfs(s);
		v.pb({f[s],sz[s]});
	}
	sort(all(v),cmp);
	while(si(v)) {
		pll p = v.back(); v.popb();
		if(p.fi*sz[u]>=p.sc*f[u]) {
			f[u]+=p.fi;
			sz[u]+=p.sc;
		}else break;
	}
}
void tc(){
	cin >> n;
	cout<<fixed<<setprecision(10);
	for(ll i = 2;i<=n;i++) cin >> par[i];
	for(ll i = 2;i<=n;i++) g[par[i]].pb(i);
	for(ll i = 1;i<=n;i++) cin >> a[i];
	dfs(1);
	for(ll i = 1;i<=n;i++) cout<<f[i]*1.0/sz[i]<<endl;
}

int main(){
	ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
	int t; t = 1;
	while(t--){
		tc();
	}
	return (0-0);
}