#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define endl '\n'
#define lowbit(x) (x)&(-x)
#define pii pair<int,int>
#define all(s) s.begin(), s.end()
#define ls(x) (x<<1)
#define rs(x) (x<<1|1) 
#define here system("pause")
using namespace std;
template <class T> inline void read(T& x) { x = 0; char c = getchar(); bool f = 0; for (; !isdigit(c); c = getchar()) f ^= (c == '-'); for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ 48); x = f ? -x : x; }
template <class T> inline void write(T x) { if (x < 0) putchar('-'), x = -x; if (x < 10) putchar(x + 48); else write(x / 10), putchar(x % 10 + 48); }

const int N = 1e5+5;
const int mod = 1e9+7;
const int INF = 8e18+7;
const double eps = 1e-6;
inline int pow(int a, int b, int p){ int res = 1%p; while(b){ if(b&1) res=res*a%p; a=a*a%p, b>>=1;} return res;}
inline int inv(int a, int p){ return pow(a,p-2,p)%p;}

int n, k;
vector<int> g[N];
unordered_map<int,int> f[N], mp;

inline void dfs(int u, int fa){
	f[u][1] = 1;
	for(int v:g[u]){
		if(v==fa) continue;
		dfs(v, u);
		for(auto x:f[u]){
			for(auto y:f[v]){
				if(x.second == 0 || y.second == 0) continue;
				if(x.first + y.first <= k+1){
					mp[x.first + y.first] = (mp[x.first + y.first] + x.second * y.second % mod) % mod;
				}
			}
		}
		swap(f[u], mp);
		mp.clear();
	}
	f[u][0] = (f[u][0] + f[u][k] + f[u][k+1]) % mod;
	f[u][k+1] = 0;
}

inline void sol(){
	cin >> n >> k;
	for(int i=1;i<=n;i++){
		g[i].clear();
		f[i].clear();
	}
	for(int i=1;i<n;i++){
		int u, v;
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	
	dfs(1, 0);
	cout << f[1][0] << endl;
}

signed main(){
	IOS;
	int tc = 1;
	cin >> tc;
	while(tc--){
		sol();
	}
	return 0;
}