#include <bits/stdc++.h>
using namespace std;

const int N = 5e3 + 5, P = 1e9 + 7;

int n;

vector<int> g[N];

bool v[N];

set<int> merge(set<int> A,set<int> B){
    if (A.size() < B.size()){
        for (int x : A) B.insert(x);
        return B;
    }
    else{
        for (int x : B) A.insert(x);
        return A;
    }
}

set<int> Find(int x,int fa){
    set<int> s;
    s.insert(x);
    for (int y : g[x]){
        if (v[y] || y == fa) continue;
        s = merge(s,Find(y,x));
    }
    return s;
}

int doit(set<int> s){
    if (s.size() == 1) return 1;
    int sum = 0;
    for (int x : s){
        v[x] = 1;
        int mul = 1;
        for (int y : g[x]){
            if (v[y]) continue;
            mul = 1ll * mul * doit(Find(y,x)) % P;
        }
        (sum += mul) %= P;
        v[x] = 0;
    }
    return sum;
}

int main(){
    cin >> n;
    for (int i = 1;i < n;i++){
        int x,y; cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    cout << doit(Find(1,0));
    return 0;
}