#include<bits/stdc++.h>

using namespace std;
#define PII pair<int,int>
#define int long long
#define inf INT64_MAX
#define endl '\n'
const int N = 2e5 + 7;
int w[N];
vector<int> arr[N];

struct Node {
    int sum;
    int cnt;

    Node() {}

    Node(int sum, int cnt) : sum(sum), cnt(cnt) {}

    Node operator+(Node a) {
        return Node(a.sum + sum, a.cnt + cnt);
    }
} node[N];

void dfs(int x, int f) {
    node[x].sum = w[x];
    node[x].cnt = 1;
    for (int y: arr[x]) {
        if (y == f)continue;
        dfs(y, x);
        if (node[x].sum * node[y].cnt <= node[y].sum * node[x].cnt)
            node[x] = node[x] + node[y];
    }
}

void solve() {
    int n;
    cin >> n;
    for (int i = 2, x; i <= n; i++) {
        cin >> x;
        arr[i].push_back(x);
        arr[x].push_back(i);
    }
    for (int i = 1; i <= n; i++)cin >> w[i];
    dfs(1, 0);
    for (int i = 1; i <= n; i++) {
        double ans = 1.0 * node[i].sum / node[i].cnt;
        cout << fixed << setprecision(10) << ans << 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;
}