#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];
ll dsu[maxn];

ll sz[maxn];

ll root(ll x) {
	while(dsu[x]!=x) {
		dsu[x] = dsu[dsu[x]];
		x = dsu[x];
	}
	return x;
}
ll dub[maxn];
bool cmp(ll i,ll j) {
	i = root(i),j = root(j);
	pll c = {a[i],sz[i]};
	pll b = {a[j],sz[j]};
	if(c.fi*b.sc==c.sc*b.fi) return dub[i]<dub[j];
	return c.fi*b.sc<c.sc*b.fi;
}

ld ans[maxn];

/**
6
1 2 2 1 4
3 1 5 6 6 7
 */
vector<ll> g[maxn];
void dfs(ll u) {
	for(ll s : g[u]) {
		dub[s] = dub[u] + 1;
		dfs(s);
	}
}
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);
	dfs(1);
	for(ll i = 1;i<=n;i++) cin >> a[i];
	set<ll,decltype(&cmp)> pq(cmp);
	for(ll i = 1;i<=n;i++) {
		dsu[i] = i;
		sz[i] = 1;
		pq.insert(i);
	}
	while(si(pq)) {
		ll i = *prev(pq.end());
		pq.erase(prev(pq.end()));
		ans[i] = a[i]*1.0/sz[i];
		//dbg(i);
		if(i==1) continue;
		ll j = par[i];
		i = root(i),j = root(j);
		if(pq.find(j)==pq.end()) continue;
		pq.erase(pq.find(j));
		dsu[i] = j;
		sz[j]+=sz[i];
		a[j]+=a[i];
		pq.insert(j);
	}
	for(ll i = 1;i<=n;i++) cout<<ans[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);
}