//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int n;
int p[200200];
ll w[200200],s[200200];
int fa[200200];
long double ans[200200];
int ok[200200];
struct cmp
{
	bool operator ()(pair<pair<ll,ll>,int> A,pair<pair<ll,ll>,int> B)
	{
		return A.first.first*B.first.second>A.first.second*B.first.first;
	}
};
inline int anc(int x)
{
	while(fa[x]!=x) x=fa[x]=fa[fa[x]];
	return x;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=2;i<=n;i++)
		cin>>p[i];
	for(int i=1;i<=n;i++)
	{
		fa[i]=i;
		cin>>w[i];
		s[i]=1;
	}
	ok[0]=1;
	priority_queue<pair<pair<ll,ll>,int>,vector<pair<pair<ll,ll>,int>>,cmp> pq;
	for(int i=1;i<=n;i++)
		pq.emplace(mp(w[i],s[i]),i);
	while(!pq.empty())
	{
		int x=pq.top().second;
		pq.pop();
		if(ok[x]) continue;
		ok[x]=1;
		ans[x]=1.0L*w[x]/s[x];
		int y=anc(p[x]);
		if(!ok[y])
		{
			w[y]+=w[x];
			s[y]+=s[x];
			pq.emplace(mp(w[y],s[y]),y);
		}
	}
	cout<<fixed<<setprecision(10);
	for(int i=1;i<=n;i++)
		cout<<ans[i]<<'\n';
	return 0;
}