#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second

using namespace std;

const int maxn = 1e5 + 10, mod = 998244353;

int t, n, k;
vector <int> v[maxn];
vector <int> dp[maxn];
vector <int> dp2;
int siz[maxn];

int add(int a, int b){
	return (a + b) % mod;
}

int mul(int a, int b){
	return ((ll)a * b) % mod;
}

void rek(int x, int p){
//	cout << x << endl;
	
	siz[x] = 1;
	dp[x].push_back(1);
	int cnt = 0, cnt2 = 0;
	
	for(int l = 0; l < v[x].size(); l++){
		int x2 = v[x][l];
		
		if(x2 == p) continue;
		
		rek(x2, x);
		
		while(dp2.size() < k + 1 && dp2.size() < dp[x].size() + dp[x2].size() - 1) dp2.push_back(0);
		
		for(int i = 0; i < dp[x].size(); i++){
			for(int j = 0; j < dp[x2].size(); j++){
				if((siz[x2] + j) % (k + 1) == 0) cnt2 = add(cnt2, mul(cnt,  dp[x2][j]));
				
				int sum = (siz[x] + i) % (k + 1) + (siz[x2] + j) % (k + 1);
				
				if(sum > k + 1) continue;
				
				if(sum == k + 1){
					cnt2 = add(cnt2, mul(dp[x][i], dp[x2][j]));
					continue;
				}
				
//				if(!i && !j) cout << x << ' ' << x2 << ' ' << dp[x][0] << ' ' << dp[x2][0] << endl;
				
				dp2[(i + j) % (k + 1)] = add(dp2[(i + j) % (k + 1)], mul(dp[x][i], dp[x2][j]));
			}
			
		}
		
		dp[x] = dp2;
		cnt = cnt2;
		dp2.clear();
		siz[x] += siz[x2];
	}
	
//	cout << x << ":\n";
//	for(int i = 0; i < dp[x].size(); i++){
//		cout << (siz[x] + i) % (k + 1) << ' ' << dp[x][i] << endl;
//	}
	
	if(siz[x] % (k + 1) + dp[x].size() > k){
		if(siz[x] % (k + 1) + dp[x].size() == k + 1) dp[x].push_back(0);
		dp[x][(k + 1 - siz[x] % (k + 1)) % (k + 1)] = add(dp[x][(k + 1 - siz[x] % (k + 1)) % (k + 1)], dp[x][k - siz[x] % (k + 1)]);
	}
	
	if(siz[x] % (k + 1) + dp[x].size() > k + 1 || siz[x] % (k + 1) == 0){
		dp[x][(k + 1 - siz[x] % (k + 1)) % (k + 1)] = add(dp[x][(k + 1 - siz[x] % (k + 1)) % (k + 1)], cnt);
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> t;
	
	while(t--){
		cin >> n >> k;
		
		for(int i = 0; i < n - 1; i++){
			int a, b;
			cin >> a >> b;
		
			v[a].push_back(b);
			v[b].push_back(a);
		}
		
		rek(1, 0);
		
		cout << dp[1][(k + 1 - n % (k + 1)) % (k + 1)] << "\n";
		
		for(int i = 1; i <= n; i++){
			v[i].clear();
			dp[i].clear();
		}
	}
	
	return 0;
}