#include <bits/stdc++.h>
using namespace std;

#define C const
#define U unsigned
#define SC static
#define CE constexpr
#define TL template
#define TN typename
#define OP operator
#define pb push_back
#define ft first
#define sd second
#define mi (l + (r - l) / 2)
#define TTT TL<TN T = I>
#define BE(v) v.begin(), v.end()
#define VD void
#define I int
#define LL long long
#define STR string
using PII = pair<I, I>;
TTT using V = vector<T>;

#define FORX(v) for(auto& x : v)
#define FORV(v, i) for (I i = 0, _n = v.size(), x = _n ? v[0] : 0;i < _n;x = v[++i])
#define FOR(i, b, e)  for(auto i = b, _e = (decltype(i))e;i != _e; ++i)
#define FORR(i, b, e) for(auto i = b, _e = (decltype(i))e;i != _e; --i)
#define FUNC(T, f, ...) function<T(__VA_ARGS__)> f = [&](__VA_ARGS__)->T

TTT CE T inf() { return numeric_limits<T>::max() / 2; }
TTT VD setmin(T& a, C T& b) { if (b < a)a = b; }
TTT VD setmax(T& a, C T& b) { if (a < b)a = b; }
TTT VD fastpow(T& a, T b, LL i) { for (;i;i >>= 1, b *= b)if (i & 1)a *= b; }

#define OPD(T,S,op,...) \
T& OP op##= (C S& _){{__VA_ARGS__} return *this;}\
friend T OP op (C T& a, C S& b) {T c = a; return c op##= b;}
#define OPB(T,op,...) friend bool OP op (C T& a, C T& b) {return __VA_ARGS__;}
#define OST(T) friend ostream& OP << (ostream & os, C T & a) { return os << a.x; }
struct Mod//WARNING : Mod MUST BE assigned in [0,m) unless using cc
{
	SC U I m; SC U LL i;
	SC VD set(U I mod) { m = mod, i = (U LL)(-1) / m + 1; }
	SC U I mul(U I a, U I b)
	{
		U LL x = (U LL)a * b, y = ((U __int128)x * i >> 64) * m;
		return x - y + (x < y ? m : 0);
	}
	U I x; CE Mod() :x(0) {}
	TTT CE Mod(T x) : x(x) {}
	TTT CE SC Mod cc(T x) { return (x % m + m) % m; }
	OPD(Mod, Mod, +, if ((x += _.x) >= m)x -= m;);
	OPD(Mod, Mod, -, if ((x += m - _.x) >= m)x -= m;);
	OPD(Mod, Mod, *, x = mul(x, _.x););
	OPD(Mod, Mod, / , fastpow(*this, _, m - 2););//m must be a prime
	OPD(Mod, I, ^, fastpow(*this, *this, _ - 1 + (_ > 0 ? 0 : m - 1)););
	OPB(Mod, == , a.x == b.x);
	OPB(Mod, != , a.x != b.x);
	OST(Mod)
};
U I Mod::m; U LL Mod::i;

using UM = unordered_map<I, Mod>;

I n, k;
V<V<I>> e;

VD dfs(V<UM>& f, I p, I fa)
{
	f[p][1] = 1;

	FORX(e[p])
	{
		if (x == fa)continue;
		dfs(f, x, p);

		static UM fp;
		fp.clear();
		for (auto& p1 : f[p])
		{
			for (auto& p2 : f[x])
			{
				if (p1.ft + p2.ft <= k + 1)fp[p1.ft + p2.ft] += p1.sd * p2.sd;
				if (p2.ft >= k) fp[p1.ft] += p1.sd * p2.sd;
			}
		}

		f[p] = move(fp);
	}
}

V<I> sz;

VD dfs(V<V<Mod>>& f, I p, I fa)
{
	f[p][1] = 1; sz[p] = 1;

	FORX(e[p])
	{
		if (x == fa)continue;
		dfs(f, x, p); sz[p] += sz[x];

		static V<Mod> fp;
		fp.clear();
		fp.resize(k + 2);
		FOR(i, 0, min(k + 1, sz[p]) + 1)
		{
			FOR(j, 0, sz[x] + 1)
			{
				if (i + j > k + 1)break;
				fp[i + j] += f[p][i] * f[x][j];
			}
			fp[i] += f[p][i] * (f[x][k] + f[x][k + 1]);
		}

		f[p] = fp;
	}
}

VD test()
{
	Mod::set(998244353);
	cin >> n >> k;
	e.clear();
	e.resize(n + 1);
	sz.resize(n + 1);

	FOR(i, 1, n)
	{
		I u, v; cin >> u >> v;
		e[u].pb(v), e[v].pb(u);
	}

	if (1ll * k * k < n)
	{
		V<V<Mod>> f(n + 1, V<Mod>(k + 2));
		dfs(f, 1, 0);
		cout << f[1][k] + f[1][k + 1] << '\n';
	}
	else
	{

		V<UM> f(n + 1);
		dfs(f, 1, 0);
		cout << f[1][k] + f[1][k + 1] << '\n';
	}

}

I main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	if (fopen("test.in", "r"))
	{
		freopen("test.in", "r", stdin);
		freopen("test.out", "w", stdout);
	}
	I t = 1;
	cin >> t;
	while (t--)test();
	return 0;
}