Score : $100$ points

Problem Statement

There is a tree with $N$ vertices, numbered $1, 2, \ldots, N$. For each $i$ ($1 \leq i \leq N - 1$), the $i$-th edge connects Vertex $x_i$ and $y_i$.

Taro has decided to paint each vertex in white or black. Here, it is not allowed to paint two adjacent vertices both in black.

Find the number of ways in which the vertices can be painted, modulo $10^9 + 7$.

Constraints

• All values in input are integers.
• $1 \leq N \leq 10^5$
• $1 \leq x_i, y_i \leq N$
• The given graph is a tree.

Input

Input is given from Standard Input in the following format:

$N$

$x_1$ $y_1$

$x_2$ $y_2$

$:$

$x_{N - 1}$ $y_{N - 1}$

Output

Print the number of ways in which the vertices can be painted, modulo $10^9 + 7$.

3
1 2
2 3

5

There are five ways to paint the vertices, as follows:

4
1 2
1 3
1 4

9

There are nine ways to paint the vertices, as follows:

1

2

10
8 5
10 8
6 5
1 5
4 8
2 10
3 6
9 2
1 7

157