#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 1000000000
#define INF 9223372036854775807
#define MOD 1000000007
#define mod 1000000007
#define INT_MAX_ 2147483647
#define EPS (1e-10)
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define rep(i,n)for (ll i = 0; i < (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
#define me memset
#define bit(n,k) ((n>>k)&1)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T> >;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp1(pair<ll,Pll> a,pair<ll,Pll> b){
        if(a.fi!=b.fi)
        return a.fi<b.fi;
        else
        return a.se.fi>b.se.fi;
}
//----------------------------------------------------------------------
ll dp[100010][2];
V<ll>G[100010];
bool color[100010];
ll d[100010];
//----------------------------------------------------------------------
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_t=clock();
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    //-------------------------------
    ll n;cin>>n;
    for(ll i=0;i<n-1;i++){
        ll u,v;cin>>u>>v;
        u--;v--;
        G[u].pb(v);
        G[v].pb(u);
    }
    if(n==1){
        cout<<2<<endl;
        return 0;
    }
    d[0]=0;
    color[0]=1;
    queue<ll>Q;
    Q.push(0);
    ll maxd=0;
    while(!Q.empty()){
        ll now=Q.front();Q.pop();
        for(ll i=0;i<G[now].size();i++){
            if(color[G[now][i]])continue;
            d[G[now][i]]=d[now]+1;
            color[G[now][i]]=1;
            Q.push(G[now][i]);
            chmax(maxd,d[G[now][i]]);
        }
    }
    V<Pll>d_i;
    for(ll i=0;i<n;i++){
        d_i.pb(mp(d[i],i));
    }
    sort(all(d_i));reverse(all(d_i));
    for(ll i=0;i<n;i++){
        if(d_i[i].fi==maxd){
            dp[d_i[i].se][0]=1;
            dp[d_i[i].se][1]=1;
        }
        else{
            dp[d_i[i].se][0]=1;
            dp[d_i[i].se][1]=1;
            for(ll j=0;j<G[d_i[i].se].size();j++){
                if(d[G[d_i[i].se][j]]==d_i[i].fi+1){
                    dp[d_i[i].se][1]*=dp[G[d_i[i].se][j]][0];
                    dp[d_i[i].se][0]*=(dp[G[d_i[i].se][j]][0]+dp[G[d_i[i].se][j]][1]);
                    dp[d_i[i].se][1]%=MOD;
                    dp[d_i[i].se][0]%=MOD;
                }
            }
        }
        //cout<<d_i[i].se<<" "<<d_i[i].fi<<" "<<dp[d_i[i].se][0]<<" "<<dp[d_i[i].se][1]<<endl;
    }
    cout<<(dp[0][1]+dp[0][0])%MOD<<endl;
    //-------------------------------  
    //fclose(stdin);
    //fclose(stdout);
    //ll end_t=clock();cout<<"time="<<end_t-begin_t<<"ms"<<endl;
    //-------------------------------
    return 0;
}
//----------------------------------------------------------------------







































Measured memory_bytes: 11888