#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> t chmax(t&a,u b){if(a<b)a=b; return a;};
template<class t, class u> t chmin(t&a,u b){if(a>b)a=b; return a;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

ll N;
vvll Graph;
vll dp_black, dp_white, dp;

ll search_white(ll, vb&);
ll search_black(ll, vb&);
ll search(ll, vb&);

ll search_white(ll root, vb& flag){
  if(dp_white[root]<INFLL) return dp_white[root];
  //debug_print("white", root);
  ll ans = 1;
  flag[root] = false;
  REP(i,Graph[root].size()){
    ll pos = Graph[root][i];
    if(!flag[pos]) continue;
    ans *= search(pos, flag);
    ans %= MOD;
  }
  flag[root] = true;
  return dp_white[root] = ans%MOD;
}

ll search_black(ll root, vb& flag){
  if(dp_black[root]<INFLL) return dp_black[root];
  //debug_print("black", root);
  ll ans = 1;
  flag[root] = false;
  REP(i,Graph[root].size()){
    ll pos = Graph[root][i];
    if(!flag[pos]) continue;
    flag[pos] = false;
    REP(j,Graph[pos].size()){
      ll next_pos = Graph[pos][j];
      if(!flag[next_pos]) continue;
      ans *= search(next_pos, flag);
      ans %= MOD;
    }
    flag[pos] = true;
  }
  flag[root] = true;
  return dp_black[root] = ans%MOD;
}

ll search(ll root, vb& flag){
  if(dp[root]<INFLL) return dp[root];
  //debug_print("search", root);
  return dp[root] = (search_white(root, flag) + search_black(root, flag))%MOD;
}

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  IN(N);
  Graph.resize(N);
  REP(i,N-1){
    ll x, y;
    IN(x,y);
    x--; y--;
    Graph[x].pb(y);
    Graph[y].pb(x);
  }

  vb flag(N, true);
  dp_black.resize(N, INFLL);
  dp_white.resize(N, INFLL);
  dp.resize(N, INFLL);

  OUT(search(0, flag));

  vec_print(dp_black);
  vec_print(dp_white);
  vec_print(dp);

  return 0;
}

Measured memory_bytes: 19968