#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


vector<int> uf;
int root(int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf[u]));
}
bool connect(int u, int v) {
  u = root(u);
  v = root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


struct Heap {
  Heap *l, *r;
  // Int key;
  Int p, q;
  int u;
  // Heap(Int key_ = 0) : l(nullptr), r(nullptr), key(key_) {}
  Heap() : l(nullptr), r(nullptr), p(0), q(0) {}
};
bool operator<(const Heap &a, const Heap &b) {
  return ((__int128)a.p * b.q < (__int128)b.p * a.q);
}
// max heap
Heap *meld(Heap *a, Heap *b) {
  if (!a) return b;
  if (!b) return a;
  // if (a->key < b->key) swap(a, b);
  if (*a < *b) swap(a, b);
  a->r = meld(a->r, b);
  swap(a->l, a->r);
  return a;
}
void pop(Heap *&a) {
  a = meld(a->l, a->r);
}


int N;
vector<int> P;
vector<Int> W;
vector<double> ans;
vector<vector<int>> graph;

vector<int> sz, del;
void dfsSz(int u, int p) {
  sz[u] = 1;
  for (const int v : graph[u]) if (p != v) {
    dfsSz(v, u);
    sz[u] += sz[v];
  }
}
string dfsString(int u, int p) {
  ostringstream oss;
  oss << "[" << u;
  for (const int v : graph[u]) if (!del[v] && p != v) {
    oss << " " << dfsString(v, u);
  }
  oss << "]";
  return oss.str();
}
/// vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
vector<Heap> nodes;
vector<int> us;
vector<vector<int>> uss;
Heap *dfs(int u, int p) {
  us.push_back(u);
  uf[u] = -1;
  Heap *ret = nullptr;
  for (const int v : graph[u]) if (!del[v] && p != v) {
    Heap *res = dfs(v, u);
    ret = meld(ret, res);
  }
  Heap *a = &nodes[u];
  *a = Heap();
  a->p = W[u];
  a->q = 1;
  a->u = u;
  for (; ret && *a < *ret; pop(ret)) {
    a->p += ret->p;
    a->q += ret->q;
    connect(u, ret->u);
  }
  ret = meld(ret, a);
  return ret;
}
/// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
void solveSubtree(int depth, int r) {
#ifdef LOCAL
  cerr << string(2 * depth, ' ') << "solveSubtree " << dfsString(r, -1) << endl;
#endif
  vector<int> vs;
  for (const int v : graph[r]) if (!del[v]) {
    vs.push_back(v);
  }
  const int len = vs.size();
  /// vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
  us.clear();
  Heap *res = dfs(r, -1);
  for (const int u : us) uss[u].clear();
  for (const int u : us) uss[root(u)].push_back(u);
  Int p = 0, q = 0;
  for (; res; pop(res)) {
// cerr<<string(2*depth,' ')<<res->p<<" "<<res->q<<" "<<res->u<<endl;
    p += res->p;
    q += res->q;
    const double avg = (double)p / q;
    for (const int u : uss[root(res->u)]) {
      chmax(ans[u], avg);
    }
  }
  /// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
}
void solveRec(int depth, int u) {
  for (; ; ) {
    int vm = -1;
    for (const int v : graph[u]) if (!del[v]) {
      if (!~vm || sz[vm] < sz[v]) {
        vm = v;
      }
    }
    if (!~vm || 2 * sz[vm] <= sz[u]) {
      solveSubtree(depth, u);
      del[u] = 1;
      for (const int v : graph[u]) if (!del[v]) {
        solveRec(depth + 1, v);
      }
      break;
    } else {
      sz[u] -= sz[vm];
      sz[vm] += sz[u];
      u = vm;
    }
  }
}
void centroidDecomp() {
  sz.assign(N, 0);
  dfsSz(0, -1);
  del.assign(N, 0);
  solveRec(0, 0);
}


int main() {
  for (; ~scanf("%d", &N); ) {
    P.assign(N, -1);
    for (int u = 1; u < N; ++u) {
      scanf("%d", &P[u]);
      --P[u];
    }
    W.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%lld", &W[u]);
    }
    
    graph.assign(N, {});
    for (int u = 1; u < N; ++u) {
      graph[P[u]].push_back(u);
      graph[u].push_back(P[u]);
    }
    
    uf.assign(N, -1);
    nodes.assign(N, Heap());
    uss.assign(N, {});
    ans.assign(N, 0.0);
    centroidDecomp();
    
    for (int u = 0; u < N; ++u) {
      printf("%.10f\n", ans[u]);
    }
  }
  return 0;
}