#include <bits/stdc++.h>
#define int long long
const int p = 998244353;
const int N = 1e5 + 9;
std::unordered_map<int, int> dp[N];
void solve()
{
    int n, k;
    std::cin >> n >> k;
    std::vector<std::vector<int>> g(n + 1);
    for (int i = 1; i <= n; ++i)
    {
        dp[i].clear();
    }
    for (int i = 1; i < n; ++i)
    {
        int u, v;
        std::cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    auto dfs = [&](auto dfs, int u, int fa) -> void
    {
        dp[u][1] = 1;
        for (auto v : g[u])
        {
            if (v == fa)
            {
                continue;
            }
            dfs(dfs, v, u); // dp
            std::unordered_map<int, int> tmp;
            for (auto [i, val1] : dp[u])
            {
                for (auto [j, val2] : dp[v])
                {
                    tmp[i + j] = (tmp[i + j] + val1 * val2 % p) % p;
                }
            }
            dp[u].swap(tmp);
        }
        dp[u][0] = dp[u][k] + dp[u][k + 1];
        dp[u][0] %= p;
    };
    dfs(dfs, 1, 0);
    std::cout << dp[1][0] << '\n';
}

signed main()
{
    std::ios::sync_with_stdio(0);
    std::cin.tie(0);
    std::cout.tie(0);
    int t;
    std::cin >> t;
    while (t--)
    {
        solve();
    }
}