#include <bits/stdc++.h>
#pragma optimize(2)
using namespace std;


using ll = long long;
using pll = pair<ll, ll>;
const int P = 998244353;
void add(ll& a, ll b) {
    a = a + b;
    if (a >= P) a -= P;
}
void solve() {
    int n, k;
    cin >> n >> k;
    vector<vector<int>> G(n + 5);
    vector<int> fa(n + 5);
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    vector<vector<pll>> dp(n + 5);
    vector<ll> f(k + 5);
    vector<int> stk;
    function<void(int)> dfs = [&](int u) {
        if (k == 1) {
            dp[u].push_back({0, 1});
            dp[u].push_back({1, 1});
        } else {
            dp[u].push_back({1, 1});
        }
        for (auto v : G[u]) {
            if (v == fa[u]) continue;
            fa[v] = u;
            dfs(v);
            for (auto [a, b] : dp[u]) {
                for (auto [c, d] : dp[v]) {
                    if (a != 0) {
                        if (a + c == k + 1) {
                            add(f[0], b * d % P);
                            stk.push_back(0);
                        } else if (a + c == k) {
                            if (c != 0) {
                                add(f[0], b * d % P);
                                stk.push_back(0);
                            }
                            add(f[k], b * d % P);
                            stk.push_back(k);
                        } else if (a + c < k) {
                            add(f[(a + c)], b * d % P);
                            stk.push_back(a + c);
                        }
                    } else if (a == 0 && c == 0) {
                        add(f[0], b * d % P);
                        stk.push_back(0);
                    }
                }
            }
            sort(stk.begin(), stk.end());
            stk.erase(unique(stk.begin(), stk.end()), stk.end());
            vector<pll> g;
            while (!stk.empty()) {
                auto x = stk.back();
                stk.pop_back();
                g.push_back({x, f[x]});
                // cout << u << ' ' << x << ' ' << f[x] << '\n';
                f[x] = 0;
            }
            dp[u] = move(g);
        }
    };
    dfs(1);
    auto p = *dp[1].rbegin();
    cout << (p.first == 0 ? p.second : 0) << '\n';
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    double prev = clock();
    // freopen("data.txt", "r", stdin);
    int T;
    cin >> T;
    while (T--)
        solve();
    double cur = clock();
    // cout << "time=" << (cur - prev) / CLOCKS_PER_SEC << '\n';
    return 0;
}