import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop, core.thread;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable MO = 10L^^9 + 7;

int N;
int[] X, Y;

int[][] G;
long[][] dp;

void solve(int u, int p) {
  foreach (v; G[u]) {
    if (v != p) {
      solve(v, u);
    }
  }
  dp[u][0] = 1;
  dp[u][1] = 1;
  foreach (v; G[u]) {
    if (v != p) {
      (dp[u][0] *= (dp[v][0] + dp[v][1])) %= MO;
      (dp[u][1] *= dp[v][0]) %= MO;
    }
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      X = new int[N - 1];
      Y = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        X[i] = readInt() - 1;
        Y[i] = readInt() - 1;
      }
      G = new int[][N];
      foreach (i; 0 .. N - 1) {
        G[X[i]] ~= Y[i];
        G[Y[i]] ~= X[i];
      }
      dp = new long[][](N, 2);
      solve(0, -1);
      long ans = (dp[0][0] + dp[0][1]) % MO;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
