#include<bits/stdc++.h>
#include<bits/extc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long long
using namespace std;
const int N=2e5+5;
const ldb INF=1e10;
int n,tim;
int a[N],f[N];
vector<int>G[N];
pair<LL,int>F[N];
struct Cmp{
	inline bool operator()(const pair<LL,int>&a,const pair<LL,int>&b)const{
		return a.first*b.second<a.second*b.first;
	}
};
struct nCmp{
	inline bool operator()(const pair<pair<LL,int>,int>&a,const pair<pair<LL,int>,int>&b)const{
		return Cmp()(a.first,b.first);
	}
};
__gnu_pbds::priority_queue<pair<pair<LL,int>,int>,nCmp>H[N];
inline void dfs(int u,int fa){
	for(auto v:G[u])if(v!=fa)
		dfs(v,u),H[u].push(make_pair(F[v],v));
	F[u]=make_pair(a[u],1);
	while(!H[u].empty()&&Cmp()(F[u],H[u].top().first)){
		auto [z,v]=H[u].top();H[u].pop();
		auto [x,y]=z;
		F[u].first+=x,F[u].second+=y;
		H[u].join(H[v]);
	}
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
	cin>>n;
	for(int i=2;i<=n;++i)
		cin>>f[i],G[f[i]].emplace_back(i);
	for(int i=1;i<=n;++i)cin>>a[i];
	dfs(1,0);
	for(int i=1;i<=n;++i)
		cout<<fixed<<setprecision(10)<<1.L*F[i].first/F[i].second<<'\n';
    return 0;
}
/*
*/