#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int>pii;
typedef pair<ll,ll>pll;
typedef pair<ld,ld>pdd;
typedef pair<ll, pair<ll, ll> > plpair;
typedef vector<int> vi;
typedef vector<ll> vl;
#define endl '\n'
#define rep(i, a, b) for (ll i = (a); i <= (b); ++i)
#define per(i, a, b) for(ll i = (a); i >= (b); --i)
#define debug(x) cout<<#x<<": "<<x<<endl
#define lowbit(id) id & (-id)
#define fi first
#define sec second
#define lc id<<1
#define rc id<<1|1
#define sz(x) (int)(x).size()
#define all(t) (t).begin(), (t).end()
#define meh {cout<<"NO"<<endl;return;}
#define yay {cout<<"YES"<<endl;return;}
#define vin(v) for(auto&x:v)cin>>x;
#define print(v) for (auto x: v)cout<<x<<' ';cout<<endl;
#define sqrt(x) sqrtl(x)
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 3e3 + 10;
const int mod = 998244353;

struct node{
	ll num;
	ll val;
};

void solve() {
	ll n, k;
	cin >> n >> k;
	vector<ll>ve[n + 5];
	vector<node>dp[n + 5];
	ll id[n + 5];
	memset(id, -1, sizeof(id));
	rep(i, 1, n - 1) {
		ll u, v;
		cin >> u >> v;
		ve[u].push_back(v);
		ve[v].push_back(u);
	}
	rep(i, 1, n) {
		dp[i].push_back({1, 1});
	}
	function<void(ll, ll)> dfs = [&](ll u, ll f) {
		for(ll v : ve[u]) {
			if(v != f) {
				dfs(v, u);
				vector<node>temp;
				ll tot = 0;
				for(node x : dp[u]) {
					for(node y : dp[v]) {
						ll num;
						if(x.num + y.num < k) {
							num = x.num + y.num;
							if(num && x.num == 0) continue;
							if(id[num] == -1) {
								id[num] = tot++;
								temp.push_back({num, 0});
							}
							temp[id[num]].val += (x.val * y.val) % mod;
							temp[id[num]].val %= mod;
						}
						else if(x.num + y.num == k) {
							num = 0;
							if(id[num] == -1) {
								id[num] = tot++;
								temp.push_back({num, 0});
							}
							temp[id[num]].val += (x.val * y.val) % mod;
							temp[id[num]].val %= mod;
							num = k;
							if(x.num == 0) continue;
							if(id[num] == -1) {
								id[num] = tot++;
								temp.push_back({num, 0});
							}
							temp[id[num]].val += (x.val * y.val) % mod;
							temp[id[num]].val %= mod;
						}
						else if(x.num + y.num == k + 1){
							num = x.num + y.num - k - 1;
							if(id[num] == -1) {
								id[num] = tot++;
								temp.push_back({num, 0});
							}
							temp[id[num]].val += (x.val * y.val) % mod;
							temp[id[num]].val %= mod;
						}
					}
				}
				dp[u] = temp;
				rep(i, 0, tot - 1) {
					id[temp[i].num] = -1;
				}
			}
		}
	};
	dfs(1, 0);
	ll ans = 0;
	for(node d : dp[1]) {
		if(d.num == 0) {
			ans = d.val;
		}
//		debug(d.num);
//		debug(d.val);
	}
	cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T = 1;
	cin >> T;
	//	cout.flush();
	//		ofstream outfile("C:\\Users\\86187\\OneDrive\\桌面\\1.txt");
	//		outfile << "a[1]=0;a[2]=1;";
	//		ll l = 1e7 + 1;
	//		rep(i, 3, 1e9) {
	//			printf("%lld\n", i);
	//			ll x = (i - 1) * ((a[i - 1] + a[i - 2]) % mod);
	//			x %= mod;
	//			if(i == l) {
	//				outfile << "a[" << i << "]=" << x << ";";
	//			}
	//			if(i == l + 1) {
	//				outfile << "a[" << i << "]=" << x << ";";
	//				l += 1e7;
	//			}
	//		}
	while(T--) {
		solve();
	}
	return 0;
}