#include <bits/stdc++.h>

using namespace std;

// #define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 200010;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

bool vis[N];
vector<int> e[N];
int n;
inline void view_all(vector<int> &cur,int x,int fa)
{
    cur.push_back(x);
    for(int p: e[x])
    {
        if (vis[p]) continue;
        if (p == fa) continue;
        view_all(cur, p, x);
    }
}
inline int calc(int x)
{
    vector<int> cur;
    int ans = 0;
    view_all(cur, x, -1);
    for(auto w : cur)
    {
        int res = 1;
        vis[w] = 1;
        for(auto p: e[w])
        {
            if (vis[p]) continue;
            res = 1ll * res * calc(p) % mod;
        }
        vis[w] = 0;
        ans = (ans + res) % mod;
    }
    return ans;
}
inline int get_ans()
{
    return calc(1);
}

signed main()
{
    read(n);
    for (int i = 1; i < n; i ++)
    {
        int a, b; read(a, b);
        e[a].push_back(b), e[b].push_back(a);
    }
    cout << get_ans() << '\n';
    return 0;
}