#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1e10;
const int MOD = 1e9 + 7;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define P pair<int, int>
#define V vector<int>
//#define S set<int>
#define itn int
bool dbg = false;

struct LowestCommonAncestor {
    int n, h;
    vector<vector<int>> G, par;
    vector<int> dep;
    LowestCommonAncestor() {}
    LowestCommonAncestor(int n) : n(n), G(n), dep(n) {
        h = 1;
        while ((1 << h) <= n)
            h++;
        par.assign(h, vector<int>(n, -1));
    }

    void add_edge(int u, int v) {
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }

    void dfs(int v, int p, int d) {
        par[0][v] = p;
        dep[v] = d;
        for (int u : G[v])
            if (u != p)
                dfs(u, v, d + 1);
    }

    void build(int r = 0) {
        dfs(r, -1, 0);
        for (int k = 0; k + 1 < h; k++)
            for (int v = 0; v < n; v++)
                if (~par[k][v])
                    par[k + 1][v] = par[k][par[k][v]];
    }

    int lca(int u, int v) {
        if (dep[u] > dep[v])
            swap(u, v);
        for (int k = 0; k < h; k++)
            if ((dep[v] - dep[u]) >> k & 1)
                v = par[k][v];

        if (u == v)
            return u;

        for (int k = h - 1; k >= 0; k--)
            if (par[k][u] != par[k][v])
                u = par[k][u], v = par[k][v];

        return par[0][u];
    }

    int distance(int u, int v) {
        return dep[u] + dep[v] - dep[lca(u, v)] * 2;
    }

    //先祖、子孫の順番のみtrue
    bool checkanc(int u, int v) {
        if (distance(u, v) + dep[u] == dep[v] && dep[u] != dep[v])
            return true;
        else
            return false;
    }
};
//それHL分解じゃなくていいの？
//Template by yosupo
template <uint MD>
struct ModInt {
    using M = ModInt;
    const static M G;
    uint v;
    ModInt(ll _v = 0) { set_v(_v % MD + MD); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(ull(v) * r.v % MD); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    M pow(ll n) const {
        M x = *this, r = 1;
        while (n) {
            if (n & 1)
                r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    M inv() const { return pow(MD - 2); }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};
using Mint = ModInt<MOD>;

int N;
Mint memo[101010][3];
bool check[101010][3];
Mint f(int x, int bef, int flag, LowestCommonAncestor& lca) {
    if (check[x][flag])
        return memo[x][flag];
    check[x][flag] = true;
    Mint ret = 1;
    for (auto nxt : lca.G[x]) {
        if (nxt == bef)
            continue;
        if (flag) {
            ret *= f(nxt, x, 0, lca);
        } else {
            ret *= f(nxt, x, 0, lca) + f(nxt, x, 1, lca);
        }
    }
    return memo[x][flag] = ret;
}


void solve() {
    LowestCommonAncestor lca(N);
    FOR(N - 1) {
        int x, y;
        cin >> x >> y;
        x--;
        y--;
        lca.add_edge(x, y);
    }
    lca.build();
    cout << f(0, -1, 1, lca) + f(0, -1, 0, lca) << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> N;

    solve();
    return 0;
}


Measured memory_bytes: 31088