#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll dp[1010][2020];
vector<int> g[1010];
int c;
ll p2[1010];
int par[1010];
void dfs(int x, int p){
	par[x]=p;
	for(auto y:g[x]){
		if(y==p) continue;
		dfs(y, x);
	}
}
ll solve(int x, int v){
	if(dp[x][v]!=-1) return dp[x][v];
	if(v>=c) return dp[x][v]=0;
	ll ret=1;
	for(auto y:g[x]){
		if(y==par[x]) continue;
		ll s=0;
		if(v-1>=0) s+=solve(y, v-1);
		if(v+1<c) s+=solve(y, v+1);
		(ret*=s)%=MOD;
	}
	return dp[x][v]=ret;
}
int main()
{
	int n, c0;
	cin>>n>>c0;
	for(int i=0; i<n-1; i++){
		int a, b; cin>>a>>b;
		a--; b--;
		g[a].push_back(b);
		g[b].push_back(a);
	}
	dfs(0, -1);
	ll ans=0;
	p2[0]=1;
	for(int i=1; i<=n; i++) p2[i]=p2[i-1]*2%MOD;
	for(int r=0; r<3; r++){
		c=(c0-r-1)/3+1;
		for(int j=0; j<n; j++) for(int i=0; i<=2*(n-1); i++) dp[j][i]=-1;
		for(int i=0; i<n; i++) solve(0, i);
		for(int i=0; i<min(c, n); i++){
			(ans+=dp[0][i])%=MOD;
		}
		for(int i=0; i<n && c-1-i>=min(c, n); i++){
			(ans+=dp[0][i])%=MOD;
		}
		if(n-1<c-n){
			(ans+=p2[n-1]*(c-2*n))%=MOD;
		}
	}
	cout<<ans<<endl;
	return 0;
}