#include <bits/stdc++.h>

using namespace std;

inline int read() {
    int x = 0, f = 0; char ch = getchar();
    while (!isdigit(ch)) f = ch == '-', ch = getchar();
    while (isdigit(ch)) x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
    return f ? -x : x;
}

const int N = 1e5 + 10, mod = 998244353;
void AddMod(int &p, int k) { p = (p + k) % mod; }
int n, K, M = 340;
int f[N][345], siz[N], tmp[345];
vector<int> g[N];

void dfs1(int x, int father) {
    siz[x] = 1;
    f[x][1] = 1;
    for (auto y : g[x]) {
        if (y == father) continue;
        dfs1(y, x);
        for (int i = 1; i <= K + 1; ++i) tmp[i] = 0;
        for (int i = 1; i <= min(siz[x], K + 1); ++i) {
            for (int j = 1; j <= min(siz[y], K + 1) && i + j <= K + 1; ++j) {
                AddMod(tmp[i + j], 1ll * f[x][i] * f[y][j] % mod);
            }
        }
        
        for (int i = 1; i <= min(siz[x], K + 1); ++i) {
            AddMod(tmp[i], 1ll * f[x][i] * f[y][K] % mod);
            AddMod(tmp[i], 1ll * f[x][i] * f[y][K + 1] % mod);
        }
        for (int i = 1; i <= K + 1; ++i) f[x][i] = tmp[i];
        siz[x] += siz[y];
    }
}

void dfs2(int x, int father) {
    siz[x] = 1;
    f[x][0] = 1;
    for (auto y : g[x]) {
        if (y == father) continue;
        dfs2(y, x);
        for (int i = 0; i <= n / K; ++i) tmp[i] = 0;
        for (int i = 0; i <= siz[x] / K; ++i) {
            for (int j = 0; j <= siz[y] / K; ++j) {
                int lax = (siz[x] - i * K) % (K + 1);
                int lay = (siz[y] - j * K) % (K + 1);
                if (lax + lay <= K + 1) {
                    AddMod(tmp[i + j], 1ll * f[x][i] * f[y][j] % mod);
                }
                if (lay == K) {
                    AddMod(tmp[i + j + 1], 1ll * f[x][i] * f[y][j] % mod);
                } 
            }
        }      
//        printf("x = %d, y = %d; \n", x, y);
        for (int i = 0; i <= n / K; ++i) {
            f[x][i] = tmp[i];
//             printf("f[%d][%d] = %d; \n", x, i, f[x][i]);
        }
        siz[x] += siz[y];
    }
}

void solve1() {
    dfs1(1, 0);
    int ans = (f[1][K] + f[1][K + 1]) % mod;
    printf("%d\n", ans);
    for (int i = 1; i <= n; ++i) {
        for (int k = 0; k <= K + 1; ++k) {
            f[i][k] = 0;
        }
    }
}

void solve2() {
    dfs2(1, 0);
    int ans = 0;
    for (int i = 0; i <= n / K; ++i) {
        int la = (n - i * K) % (K + 1);
        if ((!la) || la == K) AddMod(ans, f[1][i]);  
    }
	for (int i = 1; i <= n; ++i) {
		for (int k = 0; k <= n / K; ++k) {
			f[i][k] = 0;
		}
	}
    printf("%d\n", ans);
}

void work() {
    n = read(); K = read();
    for (int i = 1; i < n; ++i) {
        int u = read(), v = read();
        g[u].push_back(v); g[v].push_back(u);
    }
//	if (K <= M) 
		solve1();
//	else 
//        solve2();
    for (int i = 1; i <= n; ++i) g[i].clear();
}

signed main() {
    int Tt = read();
    while (Tt--) work();
}