#include<bits/stdc++.h>

using namespace std;
#define PII pair<int,int>
#define int long long
#define inf INT64_MAX
#define endl '\n'

struct Node {
    int siz;
    int sum;
    int pos;

    Node() {}

    Node(int siz, int sum, int pos) : siz(siz), sum(sum), pos(pos) {}

    friend bool operator<(Node a, Node b) {
        return a.sum * b.siz < b.sum * a.siz;
    }
};

void solve() {
    int n;
    cin >> n;
    vector<int> p(n + 1), sum(n + 1), siz(n + 1, 1), fa(n + 1);
    for (int i = 2, x; i <= n; i++) {
        cin >> x;
        p[i] = x;
    }
    priority_queue<Node> q;
    for (int i = 1; i <= n; i++) {
        fa[i] = i;
        cin >> sum[i];
        q.push(Node(siz[i], sum[i], i));
    }

    auto find = [&](auto &&self, int x) {
        if (x == fa[x])return x;
        return fa[x] = self(self, fa[x]);
    };

    vector<bool> del(n + 1);
    vector<double> ans(n + 1);
    while (q.size()) {
        int a = q.top().siz;
        int b = q.top().sum;
        int x = q.top().pos;
        q.pop();
        if (a != siz[x] || b != sum[x])continue;
        del[x] = true;

        ans[x] = 1.0 * b / a;
        if (x ^ 1) {
            int y = find(find, p[x]);

            fa[x] = y;
            siz[y] += siz[x];
            sum[y] += sum[x];
            q.push(Node(siz[y], sum[y], y));
        }
        sum[x] = 0, siz[x] = 0;
    }
    for (int i = 1; i <= n; i++) {
        cout << fixed << setprecision(12) << ans[i] << endl;
    }
}

signed main() {
#ifdef ONLINE_JUDGE
#else
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif
    ios::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    int t = 1;
//    cin >> t;
    while (t--)
        solve();
    return 0;
}