#include<bits/stdc++.h>
using namespace std;
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
#define Setprecision 10
#define between '\n'
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(T x){for(auto &y:x)*this<<y<<between;*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<Setprecision;i++)x*=10;_=x+0.5;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<Setprecision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(T c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}Writer&operator<<(std::string str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
constexpr int lim=50,up=1e9;
int fa[200001];
pair<long long,int>w[lim][200001];
vector<int>son[lim][200001];
int dfn[200001],dc=0,st[21][200001],ban[200001];
double ans[200001],dp[200001],l,r,mi;
void dfs0(int u,int f)
{
    st[0][dfn[u]=++dc]=f;
    for(auto v:son[0][u])
    dfs0(v,u);
}
int tmin(int u,int v)
{
    return dfn[u]<dfn[v]?u:v;
}
int lca(int u,int v)
{
    if(u==v)return u;
    u=dfn[u],v=dfn[v];
    if(u>v)swap(u,v);
    int k=__lg(v-u);
    return tmin(st[k][u+1],st[k][v-(1<<k)+1]);
}
void dfs(int round,int u)
{
    dp[u]=w[round][u].first-w[round][u].second*mi;
    for(auto v:son[round][u])
    {
        dfs(round,v);
        if(!ban[v]&&dp[v]>=0)dp[u]+=dp[v];
    }
}
int key[200001];
pair<long long,int>calcw1(int round,int u,int nban=0)
{
    // dbg(make_tuple(mi,round,u,ans[u],key[u],w[round-1][u]));
    w[round][u]=w[round-1][u];
	if(ban[u]&&ban[u]<round)nban=1;
	else if(nban)ban[u]=round;
	else ban[u]=0;
	if(key[u])nban=0;
    for(auto v:son[round-1][u])
    {
		int nxt=nban;
		if(ans[v]<l)nxt=1;
        auto _=calcw1(round,v,nxt);
        // dbg(make_tuple(u,v,_));
		if(!ban[v])
		{
			w[round][u].first+=_.first;
			w[round][u].second+=_.second;
		}
    }
    if(key[u])return {0,0};
    if(ans[u]>=mi)return w[round][u];
    else return {0,0};
}
pair<long long,int>calcw2(int round,int u,int nban=0)
{
    // dbg(make_tuple(mi,round,u,ans[u],key[u],w[round-1][u]));
    w[round][u]=w[round-1][u];
	if(ban[u]&&ban[u]<round)nban=1;
	else if(nban)ban[u]=round;
	else ban[u]=0;
	if(key[u])nban=0;
    for(auto v:son[round-1][u])
    {
		int nxt=nban;
		if(ans[v]<mi)nxt=1;
        auto _=calcw2(round,v,nxt);
        // dbg(make_tuple(u,v,_));
		if(!ban[v])
		{
			w[round][u].first+=_.first;
			w[round][u].second+=_.second;
		}
    }
    if(key[u])return {0,0};
    if(ans[u]>=r)return w[round][u];
    else return {0,0};
}
void solve(double l,double r,int round,const vector<int>&fvv)
{
    // dbg(make_tuple(l,r,round,fvv));
    // dbg(son[round],w[round],ban[round]);
	// assert(round<=lim);
	if((r-l)/l<=1e-6)return;
    if(fvv.empty())return;
    double mi=(l+r)/2;
    ::mi=mi,::l=l,::r=r;
    dfs(round,fvv[0]);
    // dbg(dp);
    vector<int>fvv1,fvv2;
    for(auto q:fvv)
	if(ans[q]==l)
	{
    	if(dp[q]>=0)ans[q]=mi,fvv1.emplace_back(q);
    	else fvv2.emplace_back(q);
	}
	// dbg(ans);
    if(round+1==lim)return;
    {
        for(auto q:fvv)
        key[q]=0,son[round+1][q].clear();
        vector<int>tmp=fvv1;
        for(int x=1;x<fvv1.size();x++)
        tmp.emplace_back(lca(fvv1[x-1],fvv1[x]));
        for(auto q:tmp)
        key[q]=1;
		fvv1.clear();
		for(auto q:fvv)
		if(key[q])fvv1.emplace_back(q);
        ::mi=mi,::l=l,::r=r;
        calcw2(round+1,fvv[0]);
        for(int x=1;x<fvv1.size();x++)
        {
            int l=lca(fvv1[x-1],fvv1[x]);
            son[round+1][l].emplace_back(fvv1[x]);
        }
        solve(mi,r,round+1,fvv1);
    }
    {
        for(auto q:fvv)
        key[q]=0,son[round+1][q].clear();
        vector<int>tmp=fvv2;
        for(int x=1;x<fvv2.size();x++)
        tmp.emplace_back(lca(fvv2[x-1],fvv2[x]));
        for(auto q:tmp)
        key[q]=1;
		fvv2.clear();
		for(auto q:fvv)
		if(key[q])fvv2.emplace_back(q);
        ::mi=mi,::l=l,::r=r;
        calcw1(round+1,fvv[0]);
        for(int x=1;x<fvv2.size();x++)
        {
            int l=lca(fvv2[x-1],fvv2[x]);
            son[round+1][l].emplace_back(fvv2[x]);
        }
        solve(l,mi,round+1,fvv2);
    }
}
int main()
{
    int n;
    cin>>n;
    for(int x=2;x<=n;x++)
    {
        cin>>fa[x];
        son[0][fa[x]].emplace_back(x);
    }
    dfs0(1,0);
    for(int x=1;1<<x<=n;x++)
    for(int y=1;y+(1<<x)-1<=n;y++)
    st[x][y]=tmin(st[x-1][y],st[x-1][y+(1<<x-1)]);
    vector<int>fvv;
    for(int x=1;x<=n;x++)
    cin>>w[0][x].first,w[0][x].second=1,fvv.emplace_back(x),ans[x]=1;
    sort(fvv.begin(),fvv.end(),[&](auto u,auto v){return dfn[u]<dfn[v];});
    solve(1,up,0,fvv);
    for(int x=1;x<=n;x++)
    cout<<ans[x]<<endl;
	cerr<<1.*clock()/CLOCKS_PER_SEC<<endl;
}