import sys
sys.setrecursionlimit(1000010)
def input():
	return sys.stdin.buffer.readline()[:-1]
MOD = 10**9+7

n = int(input())
aff = [0 for _ in range(n)]
adj = [[] for _ in range(n)]
for _ in range(n-1):
	u, v = map(int, input().split())
	adj[u-1].append(v-1)
	aff[v-1] += 1
for i, x in enumerate(aff):
	if x == 0:
		root = i
		break

ans = 0
dp_val = [0 for _ in range(n)]
dp_num = [1 for _ in range(n)]

ans = 0
def dfs(x, dep):
	global ans
	ans += dep * (dep+1) // 2
	ans %= MOD
	for v in adj[x]:
		dfs(v, dep+1)

dfs(root, 0)
print(ans)