#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
  }
}init;

template <typename Cost = int> class Edge{
public:
  int from,to;
  Cost cost;
  Edge() {}
  Edge(int to, Cost cost): to(to), cost(cost){}
  Edge(int from, int to, Cost cost): from(from), to(to), cost(cost){}

  Edge rev() const {return Edge(to,from,cost);}
  
  friend ostream& operator<<(ostream &os, const Edge &e){
    os << "(FROM: " << e.from << "," << "TO: " << e.to << "," << "COST: " << e.cost << ")";
    return os;
  }
};

template <typename T> using Graph = vector<vector<Edge<T>>>;
template <typename T> using Tree = vector<vector<Edge<T>>>;

template <typename C, typename T> void add_edge(C &g, int from, int to, T w){
  g[from].push_back(Edge<T>(from, to, w));  
}

template <typename C, typename T> void add_undirected(C &g, int a, int b, T w){
  g[a].push_back(Edge<T>(a, b, w));
  g[b].push_back(Edge<T>(b, a, w));
}

int N;
Tree<int> tree;

double dp1[200000];
double dp2[200000];

int deg[200000];

void dfs1(int cur){
  for(auto &e : tree[cur]){
    dfs1(e.to);
    dp1[cur] += (dp1[e.to]+1) / tree[cur].size();
  }
}

void dfs2(int cur){
  int c = tree[cur].size();

  vector<double> left(c+1);
  REP(i,c) left[i+1] = left[i] + (dp1[tree[cur][i].to]+1);

  double right = 0;

  REV(i,(int)tree[cur].size()-1,0){
    int nxt = tree[cur][i].to;

    if(deg[cur] == 1){
      dp2[nxt] = 0;
    }else{
      if(cur == 0){
        dp2[nxt] = (left[i] + right) / (deg[cur]-1);        
      }else{
        dp2[nxt] = ((dp2[cur]+1) + left[i] + right) / (deg[cur]-1);
      }
    }

    right += dp1[tree[cur][i].to]+1;
    dfs2(nxt);
  }
}

double dp[200000];

void dfs(int cur){
  if(deg[cur] != (int)tree[cur].size()) dp[cur] = dp2[cur]+1;
  for(auto &e : tree[cur]){
    dfs(e.to);
    dp[cur] += (dp1[e.to]+1);
  }
  dp[cur] /= deg[cur];
}

template <typename T>
void convert_rooted_tree(Tree<T> &tree, int cur, int par=-1){
  auto it = tree[cur].begin();
  while(it != tree[cur].end()){
    if(it->to == par) break;
    ++it;
  }
  if(it != tree[cur].end()) tree[cur].erase(it);
  for(auto &e : tree[cur]){
    convert_rooted_tree(tree,e.to,e.from);
  }
}


int main(){
  while(cin >> N){
    tree = Tree<int>(N);
    fill_array(deg, 0);

    REP(i,N-1){
      int u,v; cin >> u >> v;
      --u, --v;
      add_undirected(tree, u, v, 1);
      deg[u]++;
      deg[v]++;
    }

    convert_rooted_tree(tree, 0);


    fill_array(dp1, 0);
    fill_array(dp2, 0);
    fill_array(dp, 0);

    
    dfs1(0);
    dfs2(0);
    
    dfs(0);

    REP(i,N){
      double ans = dp[i];
      cout << fixed << setprecision(12) << ans << endl;
    }
    cerr << endl;
  }

  return 0;
}


Measured memory_bytes: 26624