#include using namespace std; #define int ll #define ll long long #define I32_MAX 2147483647 #define I64_MAX 9223372036854775807LL #define I64_MAX2 1223372036854775807LL #define INF I64_MAX2 #define MOD 1000000007 // #define MOD 998244353 #define MEM_SIZE 100010 #define DEBUG_OUT true #define ALL(x) (x).begin(), (x).end() template void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";} template void DEBUG(const std::vector& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;} template void DEBUG(const std::vector >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } } template void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);} template void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; abort();}} template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } void DFS(int V,int P, int D,vector > &GRAPH ,vector & data) { if(P != -1) { data[V] = data[P] + D; data[V] %= MOD; } for (auto &&nv : GRAPH[V]) { DFS(nv,V,D+1,GRAPH,data); } return; } void solve(void) { int N,M; cin>>N; M = N -1; vector > GRAPH (N); vector P(N,0); for (int i = 0; i < M; i++) { int A,B; cin>>A>>B; A--;B--; GRAPH[A].push_back(B); P[B]++; } int root = -1; for (int i = 0; i < N; i++) { if(P[i] == 0)root = i; } vector data (N,0); DFS(root,-1,0,GRAPH,data); int res = 0; for (auto &&x : data) { res += x; res %= MOD; } // DEBUG(data); cout<