#ifdef LOCAL
#define _GLIBCXX_DEBUG
#define debug(x) do { cerr << #x << ": " << x << endl; } while(0)
#define debug2(x, y) do { cerr << #x << ": " << x << ". " << #y << ": " << y << endl; } while(0)
#define debug3(x, y, z) do { cerr << #x << ": " << x << ". " << #y << ": " << y << ". " << #z << ": " << z << endl; } while(0)
#define debug_all(x) do { cerr << #x << ": "; for (const auto &v : x) cerr << v << ' '; cerr << endl; } while(0)
#else
#define debug(x)
  #define debug2(x, y)
  #define debug3(x, y, z)
  #define debug_all(x)
#endif
#include <bits/stdc++.h>

#define int long long

using namespace std;
using ll = long long;
using ld = long double;
void solve();
int32_t main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int t = 1;
    for (int tc = 0; tc < t; ++tc) {
        solve();
    }
    return 0;
}
const int maxn=1e6+5;
vector<int> a[maxn];
int32_t dp[300005][20][2];
int h[1<<20];
bool used[maxn];
const int p=1e9+7;
int is2[maxn];
void dfs(int x)
{
    used[x]=true;
    vector<int> ch;
    vector<int> u;
    for(int v:a[x]) {
        if (!used[v]) {
            dfs(v);
            int h=0;
            for(int i=0;i<20;++i) if(dp[v][i]) h=i;
            u.push_back(h);
            ch.push_back(v);
        }
    }
    sort(u.begin(),u.end());reverse(u.begin(),u.end());
    int mx=20;
    for(int i=0;i<u.size();++i) {mx=min(mx,u[i]+i+1);}
    for(int i=1;i<mx;++i) {
        int i1=i;
        set<int> g = {0};
        h[0] = 1;
        for (int v: ch) {
            vector<int> ins;
            set<int>::iterator it = (g.end());
            while (true) {
                --it;
                int j = (*it);
                for (int i = 19; i >= 0; --i) {
                    if(i>=i1) continue;
                    if (i != 0 && dp[v][i][0] && (j & (1 << (i - 1))) == 0) {
                        h[j + (1 << (i - 1))] += h[j]*dp[v][i][0];
                        h[j + (1 << (i - 1))] %= p;
                        ins.push_back(j + (1 << (i - 1)));
                    } else if (i == 0) {
                        h[j] *= dp[v][i][0];
                        h[j] %= p;
                    }
                }
                if (it == g.begin()) break;
            }
            for (int x: ins) g.insert(x);
        }
        dp[x][i][0]=h[(1<<(i-1))-1];dp[x][i][0]%=p;
        for(int mask:g) h[mask]=0;
    }
    for(int i=1;i<mx;++i)
    {
        int i1=i;
        set<int> g = {0};
        h[0] = 1;
        for (int v: ch) {
            vector<int> ins;
            set<int>::iterator it = (g.end());
            while (true) {
                --it;
                int j = (*it);
                for (int i = 19; i >= 0; --i) {
                    if(i>i1) continue;
                    int dp1=dp[v][i][0];
                    if(i==i1) {dp1+=dp[v][i][1];dp1%=p;}
                    if (i != 0 && dp1 && (j & (1 << (i - 1))) == 0) {
                        h[j + (1 << (i - 1))] += h[j]*dp1;
                        h[j + (1 << (i - 1))] %= p;
                        ins.push_back(j + (1 << (i - 1)));
                    } else if (i == 0) {
                        h[j] *= dp[v][i][0];
                        h[j] %= p;
                    }
                }
                if (it == g.begin()) break;
            }
            for (int x: ins) g.insert(x);
        }
        //if(x==3) cout<<i<<" i "<<h[(1<<i)-1]<<" h "<<endl;
        if(i==1) {dp[x][0][0]+=h[0];dp[x][0][0]%=p;}
        dp[x][0][0]+=2*h[(1<<i)-1];dp[x][0][0]%=p;
        for(int mask:g) h[mask]=0;
    }
    for(int i1=1;i1<mx;++i1)
    {
        for(int j1=i1+1;j1<mx;++j1)
        {
            set<int> g = {0};
            h[0] = 1;
            for (int v: ch) {
                vector<int> ins;
                set<int>::iterator it = (g.end());
                while (true) {
                    --it;
                    int j = (*it);
                    for (int i = 19; i >= 0; --i) {
                        if(i>j1) continue;
                        int dp1=dp[v][i][0];
                        if(i==j1) {dp1=dp[v][i][1];dp1%=p;}
                        if (i != 0 && dp1 && (j & (1 << (i - 1))) == 0) {
                            h[j + (1 << (i - 1))] += h[j]*dp1;
                            h[j + (1 << (i - 1))] %= p;
                            ins.push_back(j + (1 << (i - 1)));
                        } else if (i == 0) {
                            h[j] *= dp[v][i][0];
                            h[j] %= p;
                        }
                    }
                    if (it == g.begin()) break;
                }
                for (int x: ins) g.insert(x);
            }
            dp[x][i1][1]+=h[(1<<j1)-(1<<(i1-1))-1];dp[x][i1][1]%=p;
            for(int mask:g) h[mask]=0;
        }
    }
    //cout<<x<<" x "<<endl;
    //for(int i=0;i<=5;++i) cout<<dp[x][i][0]<<' '<<dp[x][i][1]<<endl;
    //cout<<endl;
}
void solve() {
    for(int i=1;i<1000000;i*=2) is2[i]=1;
    int n;cin>>n;
    for(int i=0;i<n-1;++i) {int x,y;cin>>x>>y;--x;--y;a[x].push_back(y);a[y].push_back(x);}
    dfs(0);
    cout<<(dp[0][0][0]%p+p)%p;
}