#https://atcoder.jp/contests/abc149/submissions/9700744
#
#[mod]
#https://atcoder.jp/contests/abc149/submissions/9228192
#https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a

#mod
MOD = 7 + 10 ** 9
def power(x, y)
  if y == 0
    1
  elsif y == 1
    x % MOD
  elsif y % 2 == 0
    power(x, y/2)**2 % MOD
  else
    power(x, (y-1)/2)**2 * x % MOD
  end
end
def mul(a, b)
  ((a % MOD) * (b % MOD)) % MOD
end
def div(a, b)
  mul(a, power(b, MOD-2))
end


def dfs(c, p=-1)
  res = 1
  ts = []
  
  @data[c].each do |nc|
    next if nc == p
    t = dfs(nc, c)
    res += t
    ts << t
  end
  
  if p != -1
    ts << N - res
  end
  
  now = power(2, (N - 1)) - 1
  ts.each do |t|
    now -= power(2, t) - 1
  end
  @ans += now
  return res
end


N = gets.to_i
AB = (N-1).times.map{gets.split.map(&:to_i)}
@data = Array.new(N){Array.new()}

AB.each do |a, b|
  @data[a - 1] << b - 1
  @data[b - 1] << a - 1
end

@ans = 0
dfs(0)

p div(@ans, power(2, N))
