import java.util.*; import java.io.*; public class Main { static boolean[] arrived; static long[] cum; public static void main(String[] args) throws Exception { long mod = (long)Math.pow(10,9)+7; FastScanner sc = new FastScanner(System.in); int n = sc.nextInt(); int[] from = new int[n+1]; cum = new long[n+1]; for(int i = 1; i <= n; i++){ cum[i] += cum[i-1]+i; } for(int i = 0; i < n-1; i++){ int a = sc.nextInt(); int b = sc.nextInt(); from[b] = a; } long ans = 0; int[] step = new int[n+1]; boolean[] arrived = new boolean[n+1]; Deque q = new ArrayDeque<>(); for(int i = 1; i <= n; i++){ int cnt = 0; if(arrived[i]){ continue; } int now = i; while(from[now] != 0){ if(arrived[now]){ cnt = step[now]; break; }else{ arrived[now] = true; q.add(now); } now = from[now]; } while(q.size() != 0){ long tmp = cum[q.size()+cnt]; ans += tmp; ans %= mod; int prev = q.pollLast(); step[prev] = q.size()+1+cnt; } } System.out.println(ans); } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }