macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String {
            bytes
                .by_ref()
                .map(|r| r.unwrap() as char)
                .skip_while(|c| c.is_whitespace())
                .take_while(|c| !c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{min, max};
use std::collections::HashMap;

fn main() {
    input!{
        n: usize,
        es: [(usize1, usize1); n - 1]
    }
    let mut t = vec![vec![]; n];
    for &(a, b) in &es {
        t[a].push(b);
        t[b].push(a);
    }
    let mut mem = vec![HashMap::new(); n];
    dfs(0, 0, &t, &mut mem);
    dfs2(0, 0, &t, &mut mem);
    let mut ans = 0;
    let d = 1000000007;
    for i in 0..n {
        let k = t[i].len();
        if k == 1 {
            continue;
        }
        let mut e = pow_m(2, n - 1, d) + k - 1;
        for &v in mem[i].values() {
            e = (e + d - pow_m(2, v, d)) % d;
        }
        e = e * inv_m(pow_m(2, n, d), d) % d;
        ans = (ans + e) % d;
    }
    println!("{}", ans);
}

fn dfs(v: usize, p: usize, t: &Vec<Vec<usize>>, mem: &mut Vec<HashMap<usize, usize>>) -> usize {
    let mut size = 1;
    for &c in &t[v] {
        if c == p {
            continue;
        }
        let sub = dfs(c, v, t, mem);
        mem[v].insert(c, sub);
        size += sub;
    }
    size
}

fn dfs2(v: usize, p: usize, t: &Vec<Vec<usize>>, mem: &mut Vec<HashMap<usize, usize>>) {
    let n = t.len();
    for &c in &t[v] {
        if c == p {
            continue;
        }
        let sub = *mem[v].get(&c).unwrap();
        mem[c].insert(v, n - sub);
        dfs2(c, v, t, mem);
    }
}

fn pow_m(n: usize, mut p: usize, d: usize) -> usize {
    let mut r = n;
    let mut ret = 1;
    while p > 0 {
        if p % 2 == 0 {
            r = r * r % d;
            p /= 2;
        } else {
            ret = ret * r % d;
            p -= 1;
        }
    }
    ret
}

fn inv_m(n: usize, d: usize) -> usize {
    pow_m(n, d - 2, d)
}


Measured memory_bytes: 202492