#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];

inline bool cmp(Node a, Node b) {
    return a.cnt * b.sum < b.cnt * a.sum;
}

void dfs(int x, int f) {
    node[x].sum = w[x];
    node[x].cnt = 1;
    vector<Node> tmp;
    for (int y: arr[x]) {
        if (y == f)continue;
        dfs(y, x);
        tmp.push_back({node[y].sum, node[y].cnt});
    }
    sort(tmp.begin(), tmp.end(), cmp);
    for (int i = 0; i < tmp.size(); i++) {
        if (node[x].sum * tmp[i].cnt < tmp[i].sum * node[x].cnt)node[x] = node[x] + tmp[i];
        else break;
    }
}

inline void print(int x, int y, int k) {
    cout << x / y << '.';
    for (int i = 0; i < k; i++) {
        x = x % y * 10;
        cout << x / y;
    }
    cout << endl;
}

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++) {
        print(node[i].sum, node[i].cnt, 15);
    }
}

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;
}