#pragma GCC optimize("Ofast")
#include <iostream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <unordered_map>
#include <cmath>
#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i ++ )
#define rop(i, a, b) for (int i = (a); i < (b); i ++ )
#define dep(i, a, b) for (int i = (a); i >= (b); i -- )

using namespace std;

const int N = 100010; 
const int mod = 998244353;
vector<int> E[N];
int f[N][1010], T, n, k, sz[N];
unordered_map<int, int> f2[N];
void dfs(int u, int fa) {
	sz[u] = 1; f[u][1] = 1;
	for (auto v : E[u]) if (v ^ fa) {
		dfs(v, u); vector<int> g(min(sz[u] + sz[v], k + 1) + 1);
		rep(i, 0, min(sz[u], k + 1))
			rep(j, 0, min(sz[v], k + 1 - i))
				g[i + j] = (g[i + j] + f[u][i] * f[v][j]) % mod;
		rep(i, 0, min(sz[u] + sz[v], k + 1)) f[u][i] = g[i];
		g.clear(); g.shrink_to_fit(); sz[u] += sz[v]; 
	} f[u][0] = (f[u][0] + f[u][k]) % mod;
	f[u][0] = (f[u][0] + f[u][k + 1]) % mod;
}
void dfs2(int u, int fa) {
	f2[u][1] = 1;
	for (auto v : E[u]) if (v ^ fa) {
		dfs2(v, u); unordered_map<int, int> g;
		for (auto [x1, y1] : f2[u]) for (auto [x2, y2] : f2[v])
			(g[x1 + x2] += y1 * y2 % mod) %= mod; f2[u] = g;
	} if (f2[u].find(k) != f2[u].end()) (f2[u][0] += f2[u][k]) %= mod;
	if (f2[u].find(k + 1) != f2[u].end()) (f2[u][0] += f2[u][k + 1]) %= mod;
}
signed main() {
	scanf("%lld", &T);
	while (T -- ) {
		scanf("%lld%lld", &n, &k);
		rep(i, 1, n) E[i].clear();
		rop(i, 1, n) {
			int a, b; scanf("%lld%lld", &a, &b);
			E[a].push_back(b), E[b].push_back(a);
		} if (k <= (int)sqrt(n) * 3) {
			rep(i, 1, n) rep(j, 0, k + 1) f[i][j] = 0;
			dfs(1, 0); printf("%lld\n", f[1][0]);
		} else {
			rep(i, 1, n) f2[i].clear();
			dfs2(1, 0); printf("%lld\n", f2[1][0]);
		}
	} return 0;
}