#include <bits/stdc++.h>
using namespace std;
const int N = 60;
long double dp[N][N], f[N];
int n, sz[N];
vector<int> g[N];
void dfs(int x, int fa = -1) {
  dp[x][0] = 1;
  sz[x] = 1;
  for (int i : g[x])
    if (i != fa) {
      dfs(i, x);
      for (int j = 0; j <= sz[x]; ++j)
        for (int k = 0; k <= sz[i]; ++k)
          f[j + k] +=
              dp[x][j] *
              (dp[i][k] - (k ? dp[i][k - 1] * (2 * k - 1) / (2 * k) : 0));
      sz[x] += sz[i];
      for (int j = 0; j <= sz[x]; ++j) dp[x][j] = f[j], f[j] = 0;
    }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  cout << fixed << setprecision(10);
  for (int i = 1; i < n; ++i) {
    int x, y;
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  for (int i = 1; i <= n; ++i) {
    memset(dp, 0, sizeof dp);
    dfs(i);
    long double ans = 0;
    for (int j = 0; j <= n; ++j) ans += dp[i][j];
    cout << ans << '\n';
  }
  return 0;
}
