// Hydro submission #672b2439a0596789666375d7@1730880569897
#include<bits/stdc++.h>
#define int long long
using namespace std;
long double ans[1000005];
int num[1000005];
int n;
struct node
{
	int pos;
	long double ans;
	bool operator < (const node a) const
	{
		return ans<a.ans;
	}
};
vector<int> e[1000005];
priority_queue<node> q;
signed main()
{
//	freopen("array.in","r",stdin);
//	freopen("array.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=2;i<=n;i++)
	{
		int x;
		cin>>x;
		e[i].push_back(x);
	}
	for(int i=1;i<=n;i++)
		cin>>ans[i],num[i]=1,q.push({i,ans[i]});
	while(!q.empty())
	{
		node x=q.top();
		q.pop();
		if(ans[x.pos]!=x.ans)
			continue;
		for(int y:e[x.pos])
		{
			long double newans=(ans[y]*num[y]+ans[x.pos]*num[x.pos])/(num[y]+num[x.pos]);
			if(newans>ans[y])
			{
				ans[y]=newans;
				num[y]=num[y]+num[x.pos];
				q.push({y,newans});
			}
		}
	}
	for(int i=1;i<=n;i++)
		cout<<fixed<<setprecision(10)<<ans[i]<<"\n";
}