import pypyjit pypyjit.set_param('max_unroll_recursion=-1') from collections import * from itertools import * from functools import * from heapq import * import sys input = sys.stdin.readline sys.setrecursionlimit(10**6) mod = 10**9 + 7 N = int(input()) import sys sys.setrecursionlimit(10**6) class LCA(): def __init__(self,e,root=0): self.N = len(e) self.e = e self.root = root self.IN = [-1]*N self.OUT = [-1]*N self.DIST = [-1]*N self.time = 0 self.DIST[root] = 0 self.parents = [-1]*N self.dfs(root) self.depth = [(self.DIST[i],i) for i in range(N)] self.init_val = [-1]*(2*N) for i in range(N): x = self.IN[i] y = self.OUT[i] self.init_val[x] = self.depth[i] self.init_val[y] = self.depth[self.parents[i]] self.T = self.SegTree(self.init_val) def dfs(self,x): self.IN[x] = self.time self.time += 1 for ix in e[x]: if self.DIST[ix] != -1: continue self.parents[ix] = x self.DIST[ix] = self.DIST[x] + 1 self.dfs(ix) self.OUT[x] = self.time self.time += 1 def lca(self,l,r): L = self.IN[l] R = self.IN[r] if R 1: self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1]) k >>= 1 def query(self, l, r): """ [l, r)のsegfuncしたものを得る l: index(0-index) r: index(0-index) """ res = self.ide_ele l += self.num r += self.num while l < r: if l & 1: res = self.segfunc(res, self.tree[l]) l += 1 if r & 1: res = self.segfunc(res, self.tree[r - 1]) l >>= 1 r >>= 1 return res edge = [] e = [[] for _ in range(N)] flg = [True]*N for _ in range(N-1): a,b = map(int,input().split()) a -= 1 b -= 1 e[a].append(b) e[b].append(a) flg[b] = False edge.append((a,b)) for i in range(N): if flg[i]: root = i break parents = [-1]*N sub = [-1]*N def dfs(x): tmp = 1 if len(e[x]) == 1 and x != root: sub[x] = 1 return 1 for ix in e[x]: if ix == parents[x]: continue parents[ix] = x if sub[ix] != -1: tmp += sub[ix] else: tmp += dfs(ix) sub[x] = tmp return tmp dfs(root) L = LCA(e,root) ans = 0 for a,b in edge: ans += (L.DIST[a]+1)*(sub[b]) ans %= mod print(ans)