#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define lowbit(i) (i&(-i))
#define fi first
#define se second
#define pi pair<int,int>
const int mod=998244353,maxn=2e5+5,M=100005;
inline int read(){
	char ch=getchar();int x=0;bool f=0;
	for(;!isdigit(ch);ch=getchar())if(ch=='-')f=1;
	for(;isdigit(ch);ch=getchar())x=(x<<1)+(x<<3)+(ch^48);
	if(f==1)x=-x;return x;
}
int n,k,T,x,y;
int vis[maxn],s[maxn];
vector<int>e[maxn],tmp;
vector<pi>f[maxn];
void dfs(int x,int fa){
    f[x].pb({1,1});
    for(auto i:e[x])if(i^fa){
        dfs(i,x);tmp.clear();
        for(auto t:f[x]){
            for(auto j:f[i]){
                if(!t.se||!j.se||t.fi+j.fi>k+1)continue;
                int z=t.fi+j.fi;
                if(!vis[z])vis[z]=1,tmp.pb(z);
                s[z]=(s[z]+t.se*j.se)%mod;
            }
        }f[x].clear();
        for(auto i:tmp){f[x].pb({i,s[i]});vis[i]=s[i]=0;}
    }
    int p=0;
    for(auto i:f[x])if(i.fi==k||i.fi==k+1)p=p+i.se;
    p%=mod;f[x].pb({0,p});
    //for(auto i:f[x]){cout<<x<<" "<<i.fi<<" "<<i.se<<endl;}
}
void solve(){
    n=read();k=read();
    for(int i=1;i<=n;i++)f[i].clear(),e[i].clear();
    for(int i=1;i<n;i++)
        x=read(),y=read(),e[x].pb(y),e[y].pb(x);
    dfs(1,0);
    cout<<f[1][f[1].size()-1].se<<endl;
}
signed main(){
	T=read();
	while(T--){
		solve();
	}
}