#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

const int MOD = 1000000007;

int solve(const vector<vector<int> >& edges, int curr, int prev, vector<long long>& ans)
{
    int n = 1;
    ans.assign(n+1, 0);
    ans[0] = 1;

    for(int next : edges[curr]){
        if(next == prev)
            continue;

        vector<long long> x;
        int m = solve(edges, next, curr, x);

        vector<long long> y(n+m+1, 0);
        for(int i=0; i<=n; ++i){
            for(int j=0; j<=m; ++j){
                y[i+j] += ans[i] * x[j];
                y[i+j] %= MOD;
            }
        }
        ans.swap(y);
        n += m;
    }
    ++ ans[n];

    return n;
}

int main()
{
    int n, k;
    cin >> n >> k;
    vector<vector<int> > edges(n);
    for(int i=0; i<n-1; ++i){
        int a, b;
        cin >> a >> b;
        edges[a].push_back(b);
        edges[b].push_back(a);
    }

    vector<long long> ans;
    solve(edges, 0, -1, ans);
    cout << ans[k] << endl;

    return 0;
}