#include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
map<int, int> f[100010];
vector<int> G[100010];
pair<int, int> g[100010];
int n, K;
void dfs(int x, int fa) {
    for(auto i : G[x]) {
        if(i == fa) continue;
        dfs(i, x);
    }
    map<int, int> mp;
    f[x][1] = 1;
    for(auto i : G[x]) {
        if(i == fa) continue;
        mp.clear();
        for(auto [j, k] : f[i]) {
            for(auto [j1, k1] : f[x]) {
                (mp[j + j1] += 1ll * k * k1 % MOD) %= MOD;
                if(j == K || j == K + 1) {
                    (mp[j1] += 1ll * k * k1 % MOD) %= MOD;
                }
            }
        }
        f[x] = mp;
    }
}
void Do() {
    cin >> n >> K;
    for(int i = 1; i <= n; ++ i) {
        f[i].clear();
        G[i].clear();
    }
    for(int i = 1; i <= n; ++ i) {
        g[i].first = g[i].second = 0;
    }
    for(int i = 1; i < n; ++ i) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(1, 0);
    int Ans = (f[1][K] + f[1][K + 1]) % MOD;
    cout << Ans << "\n";
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T; cin >> T;
    while(T --) {
        Do();
    }
}