#include #include #include #include #include #include #include #include #include #include #include #include #include #include #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template vector> vec2d(int n, int m, T v){ return vector>(n, vector(m, v)); } template vector>> vec3d(int n, int m, int k, T v){ return vector>>(n, vector>(m, vector(k, v))); } template void print_vector(vector v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } using mint = atcoder::modint1000000007; ostream& operator<<(ostream& os, const mint& m){ os << m.val(); return os; } const mint inv2 = mint(2).inv(); const mint inv6 = mint(6).inv(); vector g[300005]; mint dp[300005][4]; void dfs(int v, int par){ dp[v][0] = 1; dp[v][1] = 1; dp[v][2] = inv2; dp[v][3] = inv6; for(int to: g[v]){ if(to == par) continue; dfs(to, v); vector nx(4); for(int c0 = 0; c0 <= 3; c0++){ for(int c1 = 0; c0+c1 <= 3; c1++){ nx[c0+c1] += dp[v][c0]*dp[to][c1]; } } for(int c = 0; c <= 3; c++) dp[v][c] = nx[c]; } dp[v][1] *= inv2; dp[v][2] *= inv2; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int n; cin >> n; for(int i = 0; i < n-1; i++){ int a, b; cin >> a >> b; a--; b--; g[a].push_back(b); g[b].push_back(a); } dfs(0, -1); mint ans = (dp[0][3]*6)*mint(2).pow(n-1); cout << ans << endl; }