#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second
#define ull unsigned long long

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,ll y,int p=mod){
	int ans=1;y%=(p-1);
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937_64 rnd(20070819);
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

template<typename T>void cmax(T &x,T v){x=max(x,v);}
template<typename T>void cmin(T &x,T v){x=min(x,v);}

const int N=2e5+5;
vector<int>G[N];
int n;
ll a[N];

struct Info{
	int cnt;ll sum;
	Info(int C=0,ll S=0):cnt(C),sum(S){}
	bool operator<(const Info &rhs)const{
		return sum*rhs.cnt>rhs.sum*cnt;
	}
};
Info operator+(Info A,Info B){return Info(A.cnt+B.cnt,A.sum+B.sum);}
ll Cross(Info A,Info B){return A.cnt*B.sum-A.sum*B.cnt;}

struct Node{int ls,rs,siz;ull rk;Info val,sum;};

Node d[N*20];int tot=0,b[N*20],cnt;
#define ls(p) (d[p].ls)
#define rs(p) (d[p].rs)
int build(Info v){
	int p=cnt>0?b[cnt--]:++tot;d[p].ls=d[p].rs=0;
	d[p].siz=1,d[p].rk=rnd();
	d[p].val=d[p].sum=v;
	return p;
}
void del(int p){d[p].val=d[p].sum=Info(0,0),d[p].siz=d[p].rk=d[p].ls=d[p].rs=0;b[++cnt]=p;}
void pushup(int p){
	d[p].siz=d[ls(p)].siz+d[rs(p)].siz+1;
	d[p].sum=d[ls(p)].sum+d[rs(p)].sum+d[p].val;
}
void split(int p,int k,int &x,int &y){
	if(!p){x=y=0;return ;}
	if(k<=d[ls(p)].siz)y=p,split(ls(p),k,x,ls(y)),pushup(y);
	else x=p,split(rs(p),k-d[ls(p)].siz-1,rs(x),y),pushup(x);
}
int merge(int p,int q){
	if(!p||!q)return p^q;
	if(d[p].rk<d[q].rk){d[p].rs=merge(rs(p),q);pushup(p);return p;}
	else{d[q].ls=merge(p,ls(q));pushup(q);return q;}
}
int getrk(Info v,int p){
	if(!p)return 0;
	if(d[p].val<v)return d[ls(p)].siz+1+getrk(v,rs(p));
	return getrk(v,ls(p));
}
void ins(Info v,int &p){
	int k=getrk(v,p);
	int A=0,B=0;
	split(p,k,A,B);
	int q=build(v);
	p=merge(A,merge(q,B));
}
void Merge(int &p,int q){
	if(!q)return ;
	ins(d[q].val,p);
	Merge(p,ls(q)),Merge(p,rs(q));
}
void Del(int p){
	if(!p)return ;
	Del(ls(p)),Del(rs(p)),del(p);
}
int getmn(int p){
	if(!p)return 0;
	if(!ls(p))return p;
	return getmn(ls(p));
}
void pop(int &p){
	int A=0,B=0;
	split(p,1,A,B);
	p=B;
}

Info Ans;
void qry(int p,Info pf){
	if(!p)return ;
	Info L=d[ls(p)].sum;
	if(Cross(pf+L,d[p].val)>=0)Ans=pf+L+d[p].val,qry(rs(p),pf+L+d[p].val);
	else qry(ls(p),pf);
}
#undef ls
#undef rs

int root[N],sz[N];
Info ans[N];
void dfs(int u){
	sz[u]=1;
	for(int v:G[u])dfs(v),sz[u]+=sz[v];
	sort(G[u].begin(),G[u].end(),[&](int x,int y){return sz[x]>sz[y];});
	for(int v:G[u]){
		if(!root[u])root[u]=root[v];
		else Merge(root[u],root[v]),Del(root[v]);
	}

	int p=getmn(root[u]);ll c0=1,s0=a[u];
	while(p){
		if(Cross(d[p].val,Info(c0,s0))<=0){
			c0+=d[p].val.cnt,s0+=d[p].val.sum;
			pop(root[u]),p=getmn(root[u]);
		}
		else break;
	}
	ins(Info(c0,s0),root[u]);
	
	p=getmn(root[u]);
	assert(d[root[u]].siz<=2000);
	ans[u]=d[p].val;
}

ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}

signed main(void){
	
	n=read();
	for(int i=2;i<=n;i++){int p=read();G[p].emplace_back(i);}
	for(int i=1;i<=n;i++)a[i]=read();

	dfs(1);
	for(int i=1;i<=n;i++){
		auto [x,y]=ans[i];
		ll g=gcd(x,y);x/=g,y/=g;
		double dx=x,dy=y;
		cout<<fixed<<setprecision(6)<<dy/dx<<'\n';
	}

	return 0;
}