#include <bits/stdc++.h>

#define Max 100005
#define int long long

using namespace std;

const int mod=998244353;

int T,n,k,N1,N2,son[Max];
int f[Max][350],F[Max][350],g[Max][350],G[Max][350];
vector<int>E[Max];

inline int dfs(int u,int fa){
	int p=1;
	son[u]=1;
	f[u][1]=1;
	for(int v:E[u]){
		if(v==fa)continue;
		int siz=dfs(v,u);
		for(int i=min(p,k+2);i>=0;i--){
			for(int j=0;j<=siz&&i+j<=k+2;j++){
				F[u][i+j]=(F[u][i+j]+1ll*f[u][i]*f[v][j])%mod;
			}
			f[u][i]=0;
		}
		for(int j=0;j<=siz;j++)f[v][j]=0;
		for(int i=0;i<=siz+p&&i<=k+2;i++){
			f[u][i]=F[u][i];
			F[u][i]=0;
//			cout<<u<<" "<<i<<" "<<f[u][i]<<endl;
		}
		son[u]+=son[v];
		p+=siz;
	}
	f[u][0]=((f[u][0]+f[u][k])%mod+f[u][k+1])%mod;
	f[u][k+1]=0;
//	for(int i=0;i<=k+1;i++)cout<<u<<" "<<i<<" "<<f[u][i]<<endl;
	return p;
}

inline int dfs1(int u,int fa){
	f[u][0]=1;
	g[u][0]=0;
	int p=0;
	son[u]=1;
	for(int v:E[u]){
		if(v==fa)continue;
		int siz=dfs1(v,u);
		for(int i=min(p,N1+1);i>=0;i--){
			for(int j=0;j<=siz&&i+j<=N1+1;j++){
				F[u][i+j]=(F[u][i+j]+1ll*f[u][i]*f[v][j])%mod;
				G[u][i+j]=g[u][i]+g[v][j];
			}
		}
		for(int j=0;j<=siz;j++)f[v][j]=0,g[v][j]=0;
		for(int i=0;i<=siz+p&&i<=N1+1;i++){
			f[u][i]=F[u][i];
			g[u][i]=G[u][i];
			F[u][i]=0;
			G[u][i]=0;
//			cout<<u<<" "<<i<<" "<<f[u][i]<<" "<<g[u][i]<<endl;
		}
		p+=siz;
		son[u]+=son[v];
	}
	for(int i=N1+1;i>=0;i--){
		int now=son[u]-(k+1)*g[u][i]-k*i;
		if(now==k+1){
			g[u][i]=g[u][i]+1;
            F[u][i]=f[u][i];
		}else if(now==k){
			F[u][i+1]=(F[u][i+1]+f[u][i])%mod;
            F[u][i]=f[u][i];
			g[u][i+1]=g[u][i];
			p=max(p,i+1);
		}else if(now>k+1){
			F[u][i]=0;
		}else if(now<0){
            F[u][i]=0;
        }else{
            F[u][i]=f[u][i];
        }
		// cout<<"!"<<u<<" "<<i<<" "<<g[u][i]<<" "<<now<<endl;
	}
    for(int i=N1+1;i>=0;i--){
        f[u][i]=F[u][i];
        F[u][i]=0;
    }
	// for(int i=0;i<=p+1;i++){
	// 	cout<<u<<" "<<i<<" "<<f[u][i]<<" "<<g[u][i]<<endl;
	// }
	return p;
}

signed main(){
	ios::sync_with_stdio(false);
	cin>>T;
	while(T--){
		cin>>n>>k;
		for(int i=1;i<=n;i++)E[i].clear();
		for(int i=1;i<n;i++){
			int u,v;
			cin>>u>>v;
			E[u].push_back(v);
			E[v].push_back(u);
		}
		if(k<=sqrt(n)){
			dfs(1,1);
			cout<<f[1][0]%mod<<'\n';
		}else{
			N1=n/k;
			N2=n%k;
			N1-=N2;
			dfs1(1,1);
			int now=n-N1*k-g[1][N1]*(k+1);
//			cout<<now<<" "<<f[1][N1]<<" "<<g[1][N1]<<endl;
			if(now){
				cout<<0<<'\n';
			}else{
				cout<<f[1][N1]%mod<<'\n';
			}
		}
		for(int j=0;j<350;j++){
			for(int i=1;i<=n;i++){
				f[i][j]=g[i][j]=0;
			}
		}
	}
	return 0;
}