// Hydro submission #672b56e0a05967896663a32a@1730893536929
#include <bits/stdc++.h>
using namespace std;

#define min(args...) min({args})
#define max(args...) max({args})
#define redirect(filename) freopen(#filename".in", "r", stdin), freopen(#filename".out", "w", stdout)
#define all(container) (container).begin(), (container).end()
#define fastio ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define pb push_back
#define eb emplace_back

template<typename t> class gpq : public priority_queue<t, vector<t>, greater<t>> {};
typedef int64_t ll;
typedef uint64_t ull;
#if defined _WIN64 or not defined _WIN32
typedef __int128 i128;
#endif
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;

const bool MULTIPLE_TESTS = 0;

int fa[200200];
int siz[200200];
ll sm[200200];
ld ans[200200];
int n;
struct dsu{
    int fa[200200];
    int getfa(int x){return fa[x]==x?x:fa[x]=getfa(fa[x]);}
}d;
void solve(int _Tid) {
    cin>>n;
    for(int i=2;i<=n;i++)cin>>fa[i];
    for(int i=1;i<=n;i++)cin>>sm[i],siz[i]=1,d.fa[i]=i;
    priority_queue<pair<ld,int>>zq;
    for(int i=1;i<=n;i++)zq.emplace((ld)sm[i]/siz[i],i);
    while(!zq.empty()){
        auto[_,x]=zq.top();zq.pop();
        ans[x]=max(ans[x],_);
        if(abs((ld)sm[x]/siz[x]-_)>1e-10)continue;
        if(!fa[x])continue;
        int fx=d.getfa(fa[x]);
        siz[fx]+=siz[x],sm[fx]+=sm[x];
        d.fa[x]=fx;
        zq.emplace((ld)sm[fx]/siz[fx],fx);
    }
    cout<<fixed<<setprecision(12);
    for(int i=1;i<=n;i++)cout<<ans[i]<<'\n';
}

signed main() {
    fastio;
    auto _Tbe = chrono::steady_clock::now();
    int T = 1;
    if (MULTIPLE_TESTS) cin >> T;
    for (int _ = 1; _ <= T; _++) solve(_);
    auto _Ted = chrono::steady_clock::now();
    cerr<<"Used time: "<<chrono::duration_cast<chrono::milliseconds>(_Ted - _Tbe).count()<<"ms\n";
    return 0;
}