#include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int MAX = 3e5 + 10, mod = 998244353;
int T, n, k, sz[MAX], cnt[MAX];
vector<int> nei[MAX], sons[MAX], dp[MAX];
unordered_map<int, int> dp2[MAX];
void getsz(int s)
{
    sz[s] = 1;
    for (int son : nei[s])
    {
        if (sz[son])
            continue;
        sons[s].pb(son);
        getsz(son);
        sz[s] += sz[son];
    }
}
void dfs(int s)
{
    dp[s].resize(2);
    dp[s][1] = 1;
    int cnt1 = 0, cnt2 = 0;
    for (int son : sons[s])
    {
        dfs(son);
        dp[s].resize(dp[s].size() + dp[son].size());
        for (int i = min(k + 1, (int)dp[s].size() - 1); i > 0; i--)
        {
            for (int j = min(k + 1, (int)dp[son].size() - 1); j > 0; j--)
            {
                if (i + j <= min(k + 1, (int)dp[s].size() - 1))
                {
                    dp[s][i + j] = (dp[s][i + j] + 1ll * dp[s][i] * dp[son][j]) % mod;
                }
            }
            dp[s][i] = 1ll * dp[s][i] * dp[son][0] % mod;
        }
    }
    if (k + 1 < dp[s].size())
        dp[s][0] = (dp[s][k] + dp[s][k + 1]) % mod;
    else if (k < dp[s].size())
    {
        dp[s][0] = dp[s][k];
    }
}
void dfs2(int s)
{
    dp2[s][1] = 1;
    for (int son : sons[s])
    {
        dfs2(son);
        for (auto i = k+1; i; i--)
        {
            if(!dp2[s].count(i))continue;
            for (auto j = k+1; j; j--)
            {
                if (j == 0)
                    continue;
                dp2[s][i + j] = (dp2[s][i + j] + 1ll * dp2[s][i] * dp2[son][j]) % mod;
            }
            dp2[s][i] = 1ll * dp2[s][i] * dp2[son][0] % mod;
        }
    }
    if (dp2[s].count(k))
        dp2[s][0] = (dp2[s][0] + dp2[s][k]) % mod;
    if (dp2[s].count(k + 1))
        dp2[s][0] = (dp2[s][0] + dp2[s][k + 1]) % mod;
}
int main()
{
    cin >> T;
    while (T--)
    {
        cin >> n >> k;
        if (1ll*k*n<1e18)
        {
            for (int i = 1; i <= n; i++)
            {
                sz[i] = 0;
                nei[i].clear(), sons[i].clear(), dp[i].clear();
            }
            for (int i = 0; i < n - 1; i++)
            {
                int u, v;
                cin >> u >> v;
                nei[u].pb(v), nei[v].pb(u);
            }
            getsz(1), dfs(1);
            cout << dp[1][0] << endl;
        }
        else
        {
            for (int i = 1; i <= n; i++)
            {
                sz[i] = 0;
                nei[i].clear(), sons[i].clear(), dp2[i].clear();
            }
            for (int i = 0; i < n - 1; i++)
            {
                int u, v;
                cin >> u >> v;
                nei[u].pb(v), nei[v].pb(u);
            }
            getsz(1), dfs2(1);
            cout << dp2[1][0] << endl;
        }
    }
}