output_description: In i-th (1 ≤ i ≤ N) line, print the expected vaule of the number of turns
  E869120 moves.  
  The relative error or absolute error of output should be within 10^{-6}.
input_description: The input is given from standard input in the following format.  
    
  
      
      
      N
      u_1 v_1
      u_2 v_2
       :
      u_{N-1} v_{N-1}
attempt: print(float(3))
  
problem_description: Statement
  
  There is an undirected connected graph with $N$ vertices and $N-1$ edges. The
  i-th edge connects u_i and v_i.  
    
  E869120 the coder moves in the graph as follows:  
  
    * He move to adjacent vertex, but he can't a visit vertex two or more times.
    * He ends move when there is no way to move.
    * Otherwise, he moves randomly. (equal probability) If he has $p$ way to move this turn, he choose each vertex with $1/p$ probability.
  
  ![](https://atcoder.jp/img/s8pc-4/5973dad11843e9098d9225dd431c9084.png)
  
  Calculate the expected value of the number of turns, when E869120 starts from
  vertex i, for all i (1 ≤ i ≤ N).
samples: [{"input": "4\n    1 2\n    2 3\n    2 4", "output": "2.0\n    1.0\n    2.0\n    2.0"}]