object Main {
  def main(args: Array[String]): Unit = {
    val s = new Main()
    s.solve()
    s.out.flush()
  }
}

class Main {
  import java.io._
  import java.util.StringTokenizer

  import scala.collection.mutable
  import scala.util.Sorting
  import math.{abs, max, min}
  import mutable.{ArrayBuffer, ListBuffer}
  import scala.reflect.ClassTag

  val MOD = 1000000007
  val out = new PrintWriter(System.out)

  def solve(): Unit = {
    val N = ni()
    val (from, to) = na2(N - 1, -1)


    /**
      * @param n ノード数
      */
    def packUGraph(n: Int, from: Array[Int], to: Array[Int]): Array[Array[Int]] = {
      val t = new Array[Array[Int]](n)
      val p = new Array[Int](n)
      val m = from.length
      REP(m)(i => p(from(i)) += 1)
      REP(m)(i => p(to(i)) += 1)
      REP(n)(i => t(i) = new Array(p(i)))
      REP(m) { i =>
        p(from(i)) -= 1
        t(from(i))(p(from(i))) = to(i)
        p(to(i)) -= 1
        t(to(i))(p(to(i))) = from(i)
      }
      t
    }
    /**
      * @return (depth, parent, queue)
      */
    def traceBfs(g: Array[Array[Int]], rt: Int = 0): (Array[Int], Array[Int], Array[Int]) = {
      val n = g.length
      val INF = 1e9.toInt + 10
      val q, p = Array.ofDim[Int](n)
      q(0) = rt
      p(rt) = -1
      val d = Array.fill[Int](n)(INF)
      d(rt) = 0
      var cur = 0
      var last = 1
      while (cur < last) {
        val v = q(cur)
        REP(g(v).length) { i =>
          val u = g(v)(i)
          if (d(u) == INF) {
            d(u) = d(v) + 1
            p(u) = v
            q(last) = u
            last += 1
          }
        }
        cur += 1
      }
      (d, p, q)
    }

    val g = packUGraph(N, from, to)
    val (_, parent, queue) = traceBfs(g)

    val dp = Array.ofDim[Long](N, 2) // 0: 白, 1: 黒

    REP_r(N) { i =>
      val v = queue(i)
      var b = 1L
      var w = 1L
      REP(g(v).length) { j =>
        val u = g(v)(j)
        if (u != parent(v)) {
          b = b * dp(u)(0) % MOD // 黒く塗る場合は子供が全部白
          w = w * (dp(u)(1) + dp(u)(0)) % MOD // どっちもok
        }
      }
      dp(v)(0) = w
      dp(v)(1) = b
    }

//    debug(dp.map(_(0)))
//    debug(dp.map(_(1)))

    val ans = dp(0).sum % MOD
    out.println(ans)
  }


  def debug(as: Array[Boolean]): Unit = {
    System.err.println(as.map(x => if(x) "1" else "0").mkString)
  }

  def debug(as: Array[Int]): Unit = {
    System.err.println(as.mkString(" "))
  }

  def debug(as: Array[Long]): Unit = {
    System.err.println(as.mkString(" "))
  }

  def debug(s: String): Unit = {
    System.err.println(s)
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = next().toInt
    def nextLong(): Long = next().toLong
    def nextChar(): Char = next().charAt(0)
  }
  val sc = new InputReader(System.in)
  def ni(): Int = sc.nextInt()
  def nl(): Long = sc.nextLong()
  def nc(): Char = sc.nextChar()
  def ns(): String = sc.next()
  def ns(n: Int): Array[Char] = ns().toCharArray
  def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
  def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
    val A1, A2 = Array.ofDim[Int](n)
    REP(n) { i =>
      A1(i) = ni() + offset
      A2(i) = ni() + offset
    }
    (A1, A2)
  }
  def nm(n: Int, m: Int): Array[Array[Int]] = {
    val A = Array.ofDim[Int](n, m)
    REP(n) { i =>
      REP(m) { j =>
        A(i)(j) = ni()
      }
    }
    A
  }
  def nal(n: Int): Array[Long] = map(n)(_ => nl())
  def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }

  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    REP(n)(i => res(i) = f(i + offset))
    res
  }


  def sumL(as: Array[Int]): Long = {
    var s = 0L
    REP(as.length)(i => s += as(i))
    s
  }

  def cumSum(as: Array[Int]) = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}


Measured memory_bytes: 55784