#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

ll N; 
VV G;

ll dp[100010][2];
void reset(){
  rep(i, 100010){
    rep(j, 2){
      dp[i][j]=-1;
    }
  }
}

// prev
// to
// to's color (0: any, 1:black)
ll rec(ll prev, ll i, bool both){
  if(SZ(G[i])==1 && G[i][0]==prev){
    // 終点
    if(both){
      return 2;
    }else{
      return 1;
    }
  }

  if(dp[i][both]!=-1) return dp[i][both];

  ll ret = 1;
  if(!both){
    // 自分を白で塗るしかない
    for(ll to : G[i]){
      if(to==prev) continue;
      // 自分iは白しかない
      ret *= rec(i, to, true); ret%=mod;
    }
  }
  else{
    // 自分を白で塗った場合
    ll w = 1;
    for(ll to : G[i]){
      if(to==prev) continue;
      w *= rec(i, to, true); w%=mod;
    }
    // 自分を黒で塗った場合
    ll b = 1;
    for(ll to : G[i]){
      if(to==prev) continue;
      b *= rec(i, to, false); b%=mod;
    }
    ret = (w+b)%mod;
  }
  return dp[i][both] = ret;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    cin >> N;

    G.resize(N);

    rep(i, N-1){
      ll a, b; cin >> a >> b;
      a--; b--;
      G[a].push_back(b);
      G[b].push_back(a);
    }

    reset();
    dp[0][true] = 1;
    // 0が白
    ll a = 1;
    for(ll to : G[0]){
      a *= rec(0, to, true);
      a %= mod;
    }

    reset();
    dp[0][false] = 1;
    // 0が黒
    ll b = 1;
    for(ll to : G[0]){
      b *= rec(0, to, false);
      b %= mod;
    }

    debug(a, b);
    ll ans = (a+b)%mod;
    p(ans);
    
    return 0;
}

Measured memory_bytes: 14208