#include using namespace std; #define int long long #define fi first #define se second #define pb push_back #define rep(i, s, n) for (int i = s; i < n; i++) #define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--) #define all(a) a.begin(),a.end() typedef pairpint; typedef vectorvint; typedef vectorvpint; const long long MOD = 1000000007, INF = 1e18; templateinline bool chmax(T& a,T b){if(ainline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;} string get_str(string s) { s+=','; string ret=""; for(int i=0; ivector make_v(size_t a){return vector(a);} template auto make_v(size_t a,Ts... ts){ return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value==0>::type fill_v(T &t,const V &v){t=v;} template typename enable_if::value!=0>::type fill_v(T &t,const V &v){ for(auto &e:t) fill_v(e,v); } int N,K; vint g[1010]; int dp[1010][1010]; int sz[1010]; void dfs(int now,int par){ int num = 1; dp[now][0]=1; for(auto e:g[now]){ if(e==par)continue; dfs(e,now); num+=sz[e]; int new_dp[1010]={}; for(int i = 0;i < num+1;i++){ for(int j = 0;j < sz[e]+1;j++){ if(i+j>num)break; (new_dp[i+j]+=dp[now][i]*dp[e][j])%=MOD; } } swap(dp[now],new_dp); } dp[now][num]=1; sz[now]=num; } signed main() { IOS(); cin>>N>>K; rep(i,0,N-1){ int a,b; cin>>a>>b; g[a].push_back(b); g[b].push_back(a); } dfs(0,-1); cout<