#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> G[55];
long double dp[55][55];
int sz[55];
long double comb[105][105];
void dfs(int v, int p) {
  sz[v] = 0;
  dp[v][0] = 1;
  for (int i = 0; i < G[v].size(); i++) {
    int nv = G[v][i];
    if (nv == p) continue;
    dfs(nv, v);
    double tmp[55] = {}, tmp2[55] = {};
    for (int i = 0; i <= sz[nv] + sz[v]; i++) {
      tmp[i] = 0.0;
      tmp2[i] = 0.0;
    }
    for (int x = 0; x <= sz[nv]; x++) {
      for (int y = 1; y <= sz[nv]; y++) {
        tmp[x] += dp[nv][min(x, y - 1)] * (y <= x ? 0.5 : 1);
      }
    }
    for (int x = 0; x <= sz[v]; x++) {
      for (int y = 0; y <= sz[nv]; y++) {
        tmp2[x + y] += dp[v][x] * tmp[y] * comb[x + y][y] *
                       comb[sz[v] + sz[nv] - x - y][sz[nv] - y];
      }
    }
    for (int i = 0; i <= sz[v] + sz[nv]; i++) {
      dp[v][i] = tmp2[i];
    }
    sz[v] += sz[nv];
  }
  sz[v]++;
}
int main(void) {
  comb[0][0] = 1;
  for (int i = 1; i <= 102; i++) {
    for (int j = 1; j < i; j++) {
      comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
    }
    comb[i][0] = 1.0;
    comb[i][i] = 1.0;
  }
  scanf("%d", &n);
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--;
    b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  long double sum = 1;
  for (int i = 2; i <= n - 1; i++) {
    sum *= i;
  }
  for (int i = 0; i < n; i++) {
    memset(dp, 0, sizeof(dp));
    dfs(i, -1);
    printf("%.12f\n", (double)(dp[i][n - 1] / sum));
  }
  return 0;
}
