#include<bits/stdc++.h>
using namespace std;
#define time chrono::system_clock::now().time_since_epoch().count()
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
mt19937_64 rnd(time);
#define maxn 1000005
// #define int long long


int read() {int x;cin>>x;return x;}
const int mod = 998244353;

void solve() {
    int n = read(), k = read();
    vector<vector<int>>g(n + 1);
    for(int i = 1; i < n; i++) {
        int aa = read(), bb = read();
        g[aa].push_back(bb);
        g[bb].push_back(aa);
    }
    int ok = 1;
    vector<gp_hash_table<int,int>>f(n + 1);
    // vector f(n + 1, vector(3, 0ll));
    // 0:1    1:k + 1    2:sz
    vector sz(n + 1, 0ll);
    auto dfs = [&](auto dfs, int x, int fa) -> void {
        f[x][1] = 1;
        for(int i : g[x]) {
            if(i == fa) continue;
            dfs(dfs, i, x);
            gp_hash_table<int,int>ff;
            for(auto [key, val] : f[x]) {
                if(val == 0) continue;
                for(auto [k1, v1] : f[i]) {
                    if(v1 == 0) continue;
                    if(k1 + key <= k + 1) {
                        ff[k1 + key] = (ff[k1 + key] + (1ll * v1 * val)) % mod;
                    }
                    if(k1 >= k) {
                        ff[key] = (ff[key] + 1ll * val * v1) % mod;
                    }
                }
            }
            f[x] = ff;
        }
        f[x].clear();
    };

    dfs(dfs, 1, 0);
    cout << (f[1][k] + f[1][k + 1]) % mod << "\n";
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);

    int t = read();
    while(t--) solve();
    return 0;
}