using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using static System.Console;
using static System.Math;
using static MyIO;
using static MyUtil;
using static BinaryRepresentation;

public class P { public static void Main() => (new Solver()).Solve(); }

public class Solver
{
	private long N;
	private List<long>[] adj;
	private bool[] visited;
	private MInt[] f;
	private MInt[] g;

	public void Solve()
	{
		N = GetLong();
		adj = Range(0, N).Select(_ => new List<long>()).ToArray();
		for(long i = 0; i < N - 1; i++)
		{
			long x = GetLong() - 1;
			long y = GetLong() - 1;
			adj[x].Add(y);
			adj[y].Add(x);
		}
		visited = new bool[N];
		f = new MInt[N];
		g = new MInt[N];
		dfs(0);
		WriteLine(f[0].Val);
	}

	private void dfs(long v)
	{
		visited[v] = true;
		var fp = new MInt(1);
		var gp = new MInt(1);
		foreach(var u in adj[v])
		{
			if(visited[u])
				continue;

			dfs(u);
			fp *= f[u];
			gp *= g[u];
		}
		f[v] = fp + gp;
		g[v] = fp;
	}
}

public struct MInt
{
	private const long MOD = 1000000007;
	private static MInt[] f = null;
	private static MInt[] g = null;
	public long Val { get; private set; }

	public MInt(long v)
	{
		Val = (v + MOD) % MOD;
	}

	public static void InitTable(int N) => InitTable((long)N);
	public static void InitTable(long N)
	{
		f = new MInt[N + 1];
		f[0] = new MInt(1);
		for(long i = 1; i <= N; i++)
			f[i] = f[i - 1] * i;

		g = new MInt[N + 1];
		g[N] = MPow(f[N], MOD - 2);
		for(long i = N; i > 0; i--)
			g[i - 1] = g[i] * i;
	}

	public static MInt MComb(long n, long k)
	{
		if(n < 0 || n < k)
			return new MInt(0);
			
		return f[n] * g[k] * g[n - k];
	}

	public static MInt operator+(MInt x, long y) => x + new MInt(y);	
	public static MInt operator+(long x, MInt y) => new MInt(x) + y;
	public static MInt operator+(MInt x, MInt y)
	{
		long tmp = x.Val + y.Val;
		if(tmp >= MOD)
			tmp -= MOD;
		return new MInt(tmp);
	}

	public static MInt operator-(MInt x, long y) => x - new MInt(y);
	public static MInt operator-(long x, MInt y) => new MInt(x) - y;
	public static MInt operator-(MInt x, MInt y)
	{
		long tmp = x.Val;
		if(tmp < y.Val)
			tmp += MOD;
		tmp -= y.Val;
		return new MInt(tmp);
	}

	public static MInt operator*(MInt x, MInt y) => new MInt((x.Val * y.Val) % MOD);
	public static MInt operator*(MInt x, long y) => x * new MInt(y);
	public static MInt operator*(long x, MInt y) => new MInt(x) * y;

	public static MInt operator/(MInt x, MInt y) => x * MPow(y, MOD - 2);
	public static MInt operator/(MInt x, long y) => x * MPow(y, MOD - 2);
	public static MInt operator/(long x, MInt y) => x * MPow(y, MOD - 2);

	public static MInt MPow(MInt x, MInt y) => MPow(x.Val, y.Val);
	public static MInt MPow(MInt x, long y) => MPow(x.Val, y);
	public static MInt MPow(long x, MInt y) => MPow(x, y.Val);
	public static MInt MPow(long x, long y)
	{
		long exp = y;
		long xx = x;
		long res = 1;
		while(exp > 0)
		{
			if((exp & 1) == 1)
				res = (res * xx) % MOD;

			xx = (xx * xx) % MOD;
			exp >>= 1;
		}
		return new MInt(res);
	}
}

public static class BinaryRepresentation
{
	/*
	* initialize: array = { 0, 1, 2, ..., N - 1 } 
	* do { ... } while(nextPermutarion(ref array));
	*/
	public static bool nextPermutation(ref int[] array)
	{
		int len = array.Length;
		int i = len - 2;
		while((i >= 0) && (array[i] > array[i + 1]))
			i--;
		if(i < 0)
			return false;

		int pivot = array[i];
		int j = i + 1;
		while((j < len - 1) && (array[j + 1] > pivot))
			j++;
		
		int tmp = array[i];
		array[i] = array[j];
		array[j] = tmp;
		
		Array.Reverse(array, i + 1, len - i - 1);

		return true;
	}

	/* 
	* nCk
	* initialize: comb = (1 << k) - 1
	* while(comb < (1 << n)) { ...; comb = nextCombination(comb); };
	*/
	public static int nextCombination(int comb)
	{
		int x = comb & -comb;
		int y = comb + x;
		return (((comb & ~y) / x) >> 1) | y;
	}

	public static int popcnt(int v) {
		v = v - ((v >> 1) & 0x55555555);
		v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
		return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
	}

	public static long popcnt(long v) {
		v = v - ((v >> 1) & 0x5555555555555555);
		v = (v & 0x3333333333333333) + ((v >> 2) & 0x3333333333333333);
		return ((v + (v >> 4) & 0xF0F0F0F0F0F0F0F) * 0x101010101010101) >> 56;
	}
}

public static class MyIO
{
	private static string[] args = new string[0];
	private static int cnt = 0;
	private static IEnumerable<string> getArgs(long N) => Range(0, N).Select(_ => getArg());
	private static string getArg()
	{
		if(cnt == args.Length) { args = Console.ReadLine().Split(); cnt = 0; }
		return args[cnt++];
	}

	public static int GetInt() => int.Parse(getArg());
	public static long GetLong() => long.Parse(getArg());
	public static double GetDouble() => double.Parse(getArg());
	public static decimal GetDecimal() => decimal.Parse(getArg());
	public static string GetString() => getArg();
	public static char GetChar() => getArg()[0];
	public static int[] GetInts(long N) => getArgs(N).Select(int.Parse).ToArray();
	public static long[] GetLongs(long N) => getArgs(N).Select(long.Parse).ToArray();
	public static double[] GetDoubles(long N) => getArgs(N).Select(double.Parse).ToArray();
	public static decimal[] GetDecimals(long N) => getArgs(N).Select(decimal.Parse).ToArray();
	public static string[] GetStrings(long N) => getArgs(N).ToArray();
}

public static class MyUtil
{
	public static void chmax<T>(ref T x, T y) where T : IComparable<T> { if(x.CompareTo(y) < 0) x = y; }
	public static void chmin<T>(ref T x, T y) where T : IComparable<T> { if(x.CompareTo(y) > 0)	x = y; }
	public static void swap<T>(ref T x, ref T y) { T tmp = x; x = y; y = tmp; }
	public static long rightShift(long x, long y) => (x >> (int)y);
	public static long leftShift(long x, long y) => (x << (int)y);
	public static bool contains(long s, long x) => (rightShift(s, x) & 1L) == 1L;
	public static long gcd(long x, long y) => (y == 0) ? x : gcd(y, x % y);
	public static long lcm(long x, long y) => (x / gcd(x,y)) * y;	
	public static IEnumerable<int> Range(long start, long count) => Enumerable.Range((int)start, (int)count);
	public static void Sort(this List<string> source) => source.Sort(StringComparer.Ordinal);
}


Measured memory_bytes: 58596