# include <bits/stdc++.h>
using namespace std;
using i64 = long long; 
const int N = 1e5 + 5; 
const i64 mod = 998244353; 
void Add(i64 &x, i64 y) {x = (x + y) % mod; if(x < 0) x += mod; return; }
unordered_map<int, i64> dp[N]; 
vector <int> g[N]; 
int n, k, siz[N]; 
void dfs(int x, int fa)
{
    dp[x][1] = 1, siz[x] = 1; 
    for(int v : g[x])
    {
        if(v == fa) continue; 
        dfs(v, x); 
        unordered_map<int, i64> tmp; tmp.clear(); 
        for(auto it = dp[x].begin(); it != dp[x].end(); it++)
        {
            for(auto itv = dp[v].begin(); itv != dp[v].end(); itv++)
            {
                Add(tmp[(it -> first + itv -> first)], it -> second * itv -> second % mod);
                if(itv -> first == k || itv -> first == k + 1) Add(tmp[it -> first], itv -> second * it -> second % mod); 
            }
        }
        dp[x] = tmp; 
    }
    return; 
} 
int main(void)
{
    int Test; scanf("%d", &Test);
    while(Test--)
    {
        scanf("%d%d", &n, &k); 
        for(int i = 1; i <= n; i++) 
        {
            g[i].clear(), dp[i].clear();
        }
        for(int i = 1; i < n; i++)
        {
            int u, v; scanf("%d%d", &u, &v); 
            g[u].push_back(v), g[v].push_back(u); 
        }
        dfs(1, 0); 
        printf("%lld\n", (dp[1][k] + dp[1][k + 1]) % mod); 
    }
    
    return 0; 
}