#include <bits/stdc++.h>
using namespace std;
inline int read() {
  char c = getchar();
  int x = 0;
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= !(c ^ 45);
  for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
  if (f) x = -x;
  return x;
}
int n, sz[55];
vector<int> e[55];
long double f[55][55], tmp[55];
void dfs(int u, int pa) {
  sz[u] = f[u][0] = 1;
  for (auto v : e[u]) {
    if (v == pa) continue;
    dfs(v, u);
    memset(tmp, 0, sizeof tmp);
    for (register int i = (0); i <= (sz[u] - 1); ++i)
      for (register int j = (0); j <= (sz[v] - 1); ++j) {
        tmp[i + j] += f[u][i] * f[v][j] * (0.5 / (sz[v] - j) - 1);
        tmp[i + j + 1] += f[u][i] * f[v][j];
      }
    sz[u] += sz[v];
    for (register int i = (0); i <= (sz[u] - 1); ++i) f[u][i] = tmp[i];
  }
}
signed main() {
  n = read();
  for (register int i = (2); i <= (n); ++i) {
    int u = read(), v = read();
    e[u].push_back(v), e[v].push_back(u);
  }
  for (register int i = (1); i <= (n); ++i) {
    memset(f, 0, sizeof f);
    dfs(i, 0);
    long double orz = 1;
    for (auto v : e[i]) {
      long double val = 0;
      for (register int j = (0); j <= (sz[v] - 1); ++j)
        val += f[v][j] * 0.5 / (sz[v] - j);
      orz *= val;
    }
    printf("%.10lf\n", (double)orz);
  }
  return 0;
}
