let rec fix ~f x = f (fix ~f) x

let modulo = 1000000007
let (+@) a b = (a + b) mod modulo
let (-@) a b = (a - b + modulo) mod modulo
let ( *@) a b = (a * b) mod modulo
let rec ( **@) a n =
  if n = 0 then 1
  else if n mod 2 = 1 then a *@ a **@ (n-1)
  else let h = a **@ (n/2) in h *@ h
let modinv a = a **@ (modulo-2)
let (/@) a b = a *@ modinv b

let input () =
  Scanf.scanf "%d" @@ fun n ->
  let g = Array.init (n+1) (fun _ -> []) in
  for i = 1 to n-1 do
    Scanf.scanf " %d %d" @@ fun a b ->
    g.(a) <- b :: g.(a);
    g.(b) <- a :: g.(b);
  done;
  n, g

let () =
  let n, g = input () in
  let _, lvs =
    fix 1 0 [] ~f:(fun dfs u p lvs ->
      let lv, lvs =
       List.fold_left (fun (lv, lvs) v ->
          if v = p then (lv, lvs)
          else
            let c, lvs' = dfs v u lvs
            in (c :: lv, lvs')) ([], lvs) g.(u)
      in
      let cn = List.fold_left (+) 0 lv in
      let lv = n-1-cn :: lv in
      1 + cn, lv :: lvs)
  in
  List.fold_left (fun ans lv ->
    let b0 = List.fold_left (fun b0 l -> b0 /@ (2 **@ l)) 1 lv in
    let b1 = List.fold_left (fun b1 l ->
      b1 +@ b0 *@ (2 **@ l) *@ (1 -@ modinv (2 **@ l))) 0 lv in
    ans +@ (1 -@ b0 -@ b1) /@ 2) 0 lvs
  |> Printf.printf "%d\n"
    
