#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=2e5+10;
int n,a[N];
vector<int>to[N];
struct node{
	ll sum;
	int cnt;
};
bool operator < (const node &a,const node &b){
	return a.sum*b.cnt<b.sum*a.cnt;
}
node operator + (const node &a,const node &b){
	return {a.sum+b.sum,a.cnt+b.cnt};
}
priority_queue<node>q[N];
double ans[N];
void dfs(int u){
	for(int v:to[u]){
		dfs(v);
		if(q[u].size()<q[v].size())q[u].swap(q[v]);
		for(;!q[v].empty();q[v].pop())q[u].push(q[v].top());
	}
	node cur={a[u],1};
	for(;!q[u].empty()&&cur<q[u].top();q[u].pop())cur=cur+q[u].top();
	ans[u]=1.0*cur.sum/cur.cnt;
	q[u].push(cur);
}
int main(){
	scanf("%d",&n);
	for(int i=2,x;i<=n;i++){
		scanf("%d",&x),to[x].push_back(i);
	}
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	dfs(1);
	for(int i=1;i<=n;i++)printf("%.9lf\n",ans[i]);
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif