#include<bits/stdc++.h>
#define rep(i,j,k) for (int i=(j);i<=(k);++i)
#define dep(i,j,k) for (int i=(j);i>=(k);--i)
#define MAXN 100000
#define MOD 998244353
#define fi first
#define se second
using namespace std;

vector<int> g[MAXN+5];
unordered_map<int,int> dp[MAXN+5],tmp[2];
int k;

void dfs(int x,int fa) {
    for (auto i:g[x]) {
        if (i==fa) continue;
        dfs(i,x);
    }
    tmp[0].clear();tmp[1].clear();
    tmp[0].insert(make_pair(1,1));
    int t=0;
    for (auto i:g[x]) {
        if (i==fa) continue;
        tmp[t^1].clear();
        for (auto j:dp[i]) {
            for (auto l:tmp[t]) {
                if (j.fi+l.fi<=k+1) {
                    tmp[t^1][j.fi+l.fi]=(tmp[t^1][j.fi+l.fi]+1ll*j.se*l.se)%MOD;
                }
            }
        }
        t^=1;
    }
    for (auto i:tmp[t]) {
        if (i.fi==k) {
            dp[x][k]=i.se;
            dp[x][0]+=i.se;
        } else if (i.fi==k+1) {
            dp[x][0]+=i.se;
        } else {
            dp[x][i.fi]=i.se;
        }
    }
}

void solve() {
    int n,u,v;
    cin>>n>>k;
    rep(i,1,n) g[i].clear();
    rep(i,1,n) dp[i].clear();
    rep(i,1,n-1) {
        cin>>u>>v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1,0);
    cout<<dp[1][0]<<"\n";
    return;
}

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