#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int n,k;
const int N = 1e5 + 50;
vector<int> e[N];
const int P = 998244353;
const int limit = 400;
ll dp[N][limit];
ll dp1[N][limit][2];
ll tmp[limit];
ll tmp1[limit][2];
int siz[N],now[N];
void dfs0(int u,int fa){
    siz[u] = 1;
    for(int v:e[u]){
        if(v == fa) continue;
        dfs0(v,u);
        siz[u] += siz[v];
    }
}
void dfs1(int u,int fa){
    for(int v:e[u]){
        if(v == fa) continue;
        dfs1(v,u);
    }
    int t_sz = 1;
    dp[u][1] = 1;
    for(int v:e[u]){
        if(v == fa) continue;
        for(int i = 0;i <= k + 1;i ++){
            tmp[i] = 0;
        }
        for(int i = min(t_sz,k + 1);i;i --){
            for(int j = 0;j + i <= (k + 1) && j <= siz[v];j ++){
                tmp[j + i] += dp[u][i] * dp[v][j] % P;
                tmp[j + i] %= P;
            }
        }
        for(int i = 0;i <= k + 1;i ++){
            dp[u][i] = tmp[i];
        }
        t_sz += siz[v];
        t_sz = min(t_sz,k + 1);
    }
    dp[u][0] = dp[u][k] + dp[u][k + 1];
    dp[u][0] %= P;
}
void dfs2(int u,int fa){
    for(int v:e[u]){
        if(v == fa)continue;
        dfs2(v,u);
    }
    int t_sz = 1;
    dp1[u][0][0] = 1;
    for(int v:e[u]){
        if(v == fa)continue;
        for(int i = 0;i < limit;i ++){
            tmp1[i][1] = 0;
            tmp1[i][0] = 0;
        }
        for(int i = t_sz / k;i >= 0;i --){
            for(int j = 0;j + i <= (t_sz + siz[v]) / k && j <= (siz[v]) / k;j ++){
                int val1 = (t_sz - i * k) % (k + 1),val2 = (siz[v] - j * k) % (k + 1);
                if(val1 + val2 <= k + 1){
                    if(val1 != 0 && val1 + val2 != k + 1)tmp1[j + i][0] += dp1[u][i][0] * dp1[v][j][0] % P;
                    tmp1[j + i][0] %= P;
                    if(val1 != 0 && val1 + val2 >= k){
                        tmp1[j + i + 1][0] += dp1[u][i][0] * dp1[v][j][0] % P;
                        tmp1[j + i + 1][0] %= P;
                    }
                    if(val1 + val2 == k + 1){
                        tmp1[j + i][1] += dp1[u][i][0] * dp1[v][j][0] % P;
                        tmp1[j + i][1] %= P;
                    }
                    if(val1 == 0 && val2 == 0){
                        tmp1[j + i][1] += dp1[u][i][1] * dp1[v][j][0] % P;
                        tmp1[j + i][1] %= P;
                    }
                }
            }    
        }
        t_sz += siz[v];
        for(int i = 0;i < limit;i ++){
            dp1[u][i][0] = tmp1[i][0];
            dp1[u][i][1] = tmp1[i][1];
        }
        t_sz = min(t_sz,k + 1);
    }
    
    
}
void solve(){
    cin >> n >> k;
    for(int i = 1;i <= n;i ++){
        e[i].clear();
        for(int j = 0;j < limit;j ++){
            dp[i][j] = 0;
        }
    }
    for(int i = 1;i < n;i ++){
        int u,v;
        cin >> u >> v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    dfs0(1,0);
    if(k + 10 < limit){
        dfs1(1,1);
        cout << dp[1][0] << '\n';
    }else {
        // assert(0);
        dfs2(1,1);
        ll ans = 0;
        for(int i = 0;i <= (siz[1]) / k;i ++){
            if((siz[1] - i * k) % (k + 1) == 0)ans += dp1[1][i][0];
            ans %= P;
        }
        cout << ans << '\n';
    }
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(0);
    int t = 1;
    cin >> t;
    while(t --)solve();
}