#include #define fi first #define se second #define rep(i,n) for(int i = 0; i < (n); ++i) #define rrep(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define rng(a) a.begin(),a.end() #define rrng(a) a.rbegin(),a.rend() #define maxs(x,y) (x = max(x,y)) #define mins(x,y) (x = min(x,y)) #define isin(x,l,r) ((l) <= (x) && (x) < (r)) #define pb push_back #define eb emplace_back #define sz(x) (int)(x).size() #define pcnt __builtin_popcountll #define uni(x) x.erase(unique(rng(x)),x.end()) #define snuke srand((unsigned)clock()+(unsigned)time(NULL)); #define show(x) cout<<#x<<" = "< > #define bn(x) ((1< #define vv(T) v(v(T)) using namespace std; typedef long long int ll; typedef unsigned uint; typedef unsigned long long ull; typedef pair P; typedef tuple T; typedef vector vi; typedef vector vvi; typedef vector vl; typedef vector

vp; typedef vector vt; inline int getInt() { int x; scanf("%d",&x); return x;} templateinline istream& operator>>(istream&i,v(T)&v) {rep(j,sz(v))i>>v[j];return i;} templatestring join(const v(T)&v) {stringstream s;rep(i,sz(v))s<<' '<inline ostream& operator<<(ostream&o,const v(T)&v) {if(sz(v))o<inline istream& operator>>(istream&i,pair&v) {return i>>v.fi>>v.se;} templateinline ostream& operator<<(ostream&o,const pair&v) {return o<inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; #define dame { puts("-1"); return 0;} #define yn {puts("Yes");}else{puts("No");} const int MX = 300005; // Mod int const int mod = 1000000007; // const int mod = 998244353; struct mint { ll x; mint():x(0){} mint(ll x):x((x%mod+mod)%mod){} // mint(ll x):x(x){} mint& fix() { x = (x%mod+mod)%mod; return *this;} mint operator-() const { return mint(0) - *this;} mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;} mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;} mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;} mint operator+(const mint& a)const{ return mint(*this) += a;} mint operator-(const mint& a)const{ return mint(*this) -= a;} mint operator*(const mint& a)const{ return mint(*this) *= a;} bool operator<(const mint& a)const{ return x < a.x;} bool operator==(const mint& a)const{ return x == a.x;} }; istream& operator>>(istream&i,mint&a){i>>a.x;return i;} ostream& operator<<(ostream&o,const mint&a){o< vm; // vi to[MX]; vm dp[MX]; void dfs(int v, int p=-1) { dp[v] = vm(8,1); vm& d = dp[v]; for (int u : to[v]) { if (u == p) continue; dfs(u,v); vm& e = dp[u]; vm pd(8); swap(d,pd); rep(i,8)rep(j,8) { if (i&j) continue; mint c = 1; if (!j || j == 7) c = 2; d[i|j] += pd[i]*e[j]*c; } } } int main() { int n; scanf("%d",&n); rep(i,n-1) { int a,b; scanf("%d%d",&a,&b); --a; --b; to[a].pb(b); to[b].pb(a); } dfs(0); mint ans = dp[0][7]; cout<