#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void chkmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
inline void chkmin(T &a, T b) {
  if (a > b) a = b;
}
inline int read() {
  int sum = 0, p = 1;
  char ch = getchar();
  while (!(('0' <= ch && ch <= '9') || ch == '-')) ch = getchar();
  if (ch == '-') p = -1, ch = getchar();
  while ('0' <= ch && ch <= '9') sum = sum * 10 + ch - 48, ch = getchar();
  return sum * p;
}
const int maxn = 120;
struct node {
  int v, next;
};
node e[maxn];
int cnt, start[maxn];
inline void addedge(int u, int v) {
  e[++cnt] = (node){v, start[u]};
  start[u] = cnt;
}
int n;
double C[maxn][maxn];
inline void init() {
  n = read();
  for (int i = (1), _end_ = (n - 1); i <= _end_; i++) {
    int u = read(), v = read();
    addedge(u, v);
    addedge(v, u);
  }
  C[0][0] = 1;
  for (int i = (1), _end_ = (n); i <= _end_; i++)
    for (int j = (0), _end_ = (i); j <= _end_; j++)
      C[i][j] = ((j ? C[i - 1][j - 1] : 0) + C[i - 1][j]);
}
double dp[maxn][maxn];
int sz[maxn];
double tmp[maxn];
void dfs(int u, int fa) {
  sz[u] = 0;
  dp[u][0] = 1;
  for (int i = start[(u)]; i; i = e[i].next) {
    int v = e[i].v;
    if (v == fa) continue;
    dfs(v, u);
    tmp[0] = 0;
    for (int a = (1), _end_ = (sz[v]); a <= _end_; a++)
      tmp[a] = tmp[a - 1] + dp[v][a - 1];
    for (int a = (0), _end_ = (sz[v]); a <= _end_; a++)
      tmp[a] = tmp[a] * 0.5 + dp[v][a] * (sz[v] - a);
    for (int a = (sz[u]), _end_ = (0); a >= _end_; a--) {
      double tmp1 = dp[u][a];
      dp[u][a] = 0;
      for (int b = (sz[v]), _end_ = (0); b >= _end_; b--)
        dp[u][a + b] +=
            (tmp1 * tmp[b] * C[a + b][a] * C[sz[u] + sz[v] - a - b][sz[u] - a]);
    }
    sz[u] += sz[v];
  }
  sz[u]++;
}
inline void doing() {
  double fac = 1;
  for (int i = (1), _end_ = (n - 1); i <= _end_; i++) fac *= i;
  for (int i = (1), _end_ = (n); i <= _end_; i++) {
    memset(dp, 0, sizeof(dp));
    dfs(i, 0);
    printf("%.8lf\n", dp[i][n - 1] / fac);
  }
}
int main() {
  init();
  doing();
  return 0;
}
