#include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const int N=3e5+5;
const int M=20;

vector<int>G[N];
int siz[N];
int f[N][M][2],ans[N];
int n;

int mul(int a,int b){return 1ll*a*b%mod;}
void inc(int &a,int b){a=a>=mod-b?a-mod+b:a+b;}

void dfs(int u,int fath){
    siz[u]=1;
    if(u!=1)G[u].erase(find(G[u].begin(),G[u].end(),fath));
    for(auto v:G[u])dfs(v,u),siz[u]+=siz[v];
    sort(G[u].begin(),G[u].end(),[&](int x,int y){return siz[x]<siz[y];});

    {
    vector<int> g(2),h(2);
    g[0]=1;
    int k=0;
    for(auto v:G[u]){
        if(v!=G[u].back()) k=__lg(siz[v]);
        else ++k;
        g.resize(1<<k+2),h.resize(1<<k+2);

        for(int s=0;s<(1<<k+2);++s)h[s]=mul(g[s],ans[v]);
        for(int s=0;s<(1<<k+2);++s)
            for(int j=0;j<k+2;++j)if(~s>>j&1) 
                inc(h[s^(1<<j)],mul(g[s],f[v][j][0]));
        swap(g,h);
    }

    for(int i=0;i<=k+2;++i){
        f[u][i][0]=g[(1<<i)-1];
        inc(ans[u],f[u][i][0]);
        for(int j=0;j<i;++j)
            inc(f[u][j][1],g[(1<<i)-1-(1<<j)]);
    }
    }

    {
    vector<array<int,2> >g(2),h(2);
    g[0][0]=1;
    int k=0;
    for(auto v:G[u]){
        if(v!=G[u].back()) k=__lg(siz[v]);
        else ++k;

        g.resize(1<<k+2),h.resize(1<<k+2);

        for(int s=0;s<(1<<k+2);++s)
            h[s][0]=mul(g[s][0],ans[v]),
            h[s][1]=mul(g[s][1],ans[v]);
        for(int s=0;s<(1<<k+2);++s)
            for(int j=0;j<k+2;++j)if(~s>>j&1){
                inc(h[s^(1<<j)][0],mul(g[s][0],f[v][j][0]));
                if((1<<j)<s) inc(h[s^(1<<j)][1],mul(g[s][1],f[v][j][0]));
            }
        for(int j=0;j<k+2;++j)
            for(int s=0;s<(1<<j);++s)
                inc(h[s^(1<<j)][1],mul(g[s][0],f[v][j][1]));
        swap(g,h);
    }    

    for(int i=0;i<=k+2;++i){
        inc(ans[u],g[(1<<i)-1][1]);
        for(int j=0;j<i-1;++j)
            inc(f[u][j][1],g[(1<<i)-1-(1<<j)][1]);
    }
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    cin>>n;
    for(int i=1,u,v;i<n;++i)
        cin>>u>>v,G[u].push_back(v),G[v].push_back(u);

    dfs(1,0);

    cout<<ans[1]<<'\n';
    return 0;
}