#include<iostream>
#include<vector>
using namespace std;
 
class ModInt{
private:
  long long val;
  static const int default_mod = 1e9 + 7;
  static int mod;
  static vector<ModInt> facts;
public:
  ModInt(long long val)
  {
    if(mod == 0){
      mod = default_mod;
    }
    this->val = ((val % mod) + mod) % mod;
  }
  ModInt()
    : ModInt(0)
  {
  }
  static void setMod(int mod){
    if(ModInt::mod != 0){
      throw "The modulo is already set.";
    }
    ModInt::mod = mod;
  }

  const ModInt operator* (const ModInt& another) const{
    return ModInt(val * another.val);
  }
  ModInt operator+ (const ModInt& another){
    return ModInt(val + another.val);
  }
  ModInt operator- (const ModInt & another){
    return ModInt(val - another.val + mod);
  }
  ModInt operator/(const ModInt& rhs){
    return (*this) * rhs.inv();
  }
  ModInt& operator*=(const ModInt& rhs){
    (*this) = (*this) * rhs;
    return *this;
  }
  ModInt& operator+=(const ModInt& rhs){
    (*this) = (*this) + rhs;
    return *this;
  }
  ModInt& operator-=(const ModInt& rhs){
    (*this) = (*this) - rhs;
    return *this;
  }
  ModInt& operator/=(const ModInt& rhs){
    (*this) = (*this) / rhs;
    return *this;
  }
  ModInt pow(long long exponent) const{
    exponent %= mod - 1;
    if(exponent == 0){
      return ModInt(1);
    }else{
      if(exponent % 2){
        return ((*this) * (*this)).pow(exponent / 2) * (*this);
      }else{
        return ((*this) * (*this)).pow(exponent / 2);
      }
    }
  }
  ModInt inv() const{
    return this->pow(mod - 2);
  }
  static ModInt fact(long long n){
    if(n >= mod){
      return 0;
    }
    if(facts.size() < static_cast<size_t>(n + 1)){
      if(facts.size() == 0){
        facts.push_back(1);
      }
      for(int i = facts.size(); i <= n; i++){
        facts.push_back(facts[i - 1] * i);
      }
    }
    return facts[n];
  }
  static ModInt comb(long long n, long long r){
    if(r > n){
      return 0;
    }
    return ModInt::fact(n) * ModInt::fact(r).inv() * ModInt::fact(n - r).inv();
  }
 
  friend ostream& operator<< (ostream& os, const ModInt& modint){
    os << modint.val;
    return os;
  }
  friend istream& operator>>(istream& is, ModInt& modint){
    long long val;
    is >> val;
    modint.val = val % modint.mod;
    return is;
  }
  friend ModInt operator*(const long long lhs, const ModInt& rhs){
    return ModInt(lhs) * rhs;
  }
};
int ModInt::mod = 0;
vector<ModInt> ModInt::facts;

void calc_dp(int now, int prev, vector<ModInt>& dp_b, vector<ModInt>& dp_w, vector<vector<int>>& adj, vector<bool>& checked){
  if(checked[now]){
    return;
  }
  
  ModInt ret_b = 1, ret_w = 1;
  for(auto next: adj[now]){
    if(next != prev){
      calc_dp(next, now, dp_b, dp_w, adj, checked);
      ret_b *= dp_w[next];
      ret_w *= dp_b[next] + dp_w[next];
    }
  }
  checked[now] = true;
  dp_b[now] = ret_b;
  dp_w[now] = ret_w;
  
}

int main(){
  int N;
  cin >> N;

  vector<vector<int>> adj(N);
  for(int i = 0; i < N - 1; i++){
    int x, y;
    cin >> x >> y;
    x--;
    y--;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }

  // black, white
  // ans = dp_b[0] + dp_w[0]
  // dp_b[i] = prod_{j in adj[i], j != prev} dp_w[j]
  // dp_w[i] = prod_{j in adj[i], j != prev} (dp_w[j] + dp_b[j])
  vector<ModInt> dp_b(N), dp_w(N);
  vector<bool> checked(N);
  calc_dp(0, -1, dp_b, dp_w, adj, checked);
  cout << dp_b[0] + dp_w[0] << endl;
  /*
  for(int i = 0; i < N; i++){
    cout << dp_b[i] << ' ' << dp_w[i] << endl;
  }
  */
}


Measured memory_bytes: 18432