#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 3e5 + 5, M = 205, mod = 998244353;
int dp[N][M][2], sz[N], ans[M];
int S[M][M], m;
vector<int> e[N];
void dfs(int x, int f)
{
	int i, j, k;
	sz[x] = 0;
	for(i = 0; i <= m; i++)
		dp[x][i][0] = dp[x][i][1] = (!i);
	for(auto y: e[x])
		if(y != f)
		{
			dfs(y, x);
			for(i = min(sz[x], m); i >= 0; i--)
				for(j = min(sz[y], m - i); j >= 0; j--)
				{
					dp[x][i + j][0] = (dp[x][i + j][0] + (ll)dp[x][i][0] * dp[y][j][1]) % mod;
					dp[x][i + j][1] = (dp[x][i + j][1] + (ll)dp[x][i][1] * (dp[y][j][0] + dp[y][j][1])) % mod;
				}
			for(i = min(sz[y], m); i >= 0; i--)
				ans[i] = ((ans[i] + mod - dp[y][i][0]) % mod + mod - dp[y][i][1]) % mod;
			for(i = min(sz[y] + 1, m); i >= 1; i--)
				ans[i] = (ans[i] + mod - dp[y][i - 1][0]) % mod;
			sz[x] += sz[y];
		}
	dp[x][0][0] = (dp[x][0][0] + mod - 1) % mod;
	dp[x][0][1] = (dp[x][0][1] + mod - 1) % mod;
	for(i = 0; i <= min(sz[x], m); i++)
		dp[x][i][1] = (dp[x][i][1] + mod - dp[x][i][0]) % mod;
	for(i = 0; i <= min(sz[x], m); i++)
	{
		dp[x][i][0] = 2ll * dp[x][i][0] % mod;
		dp[x][i][1] = 2ll * dp[x][i][1] % mod;
	}
	++sz[x];
	for(i = min(sz[x], m); i >= 0; i--)
		dp[x][i][1] = (dp[x][i][1] + dp[x][i - 1][1]) % mod;
	dp[x][0][0] = (dp[x][0][0] + 1) % mod;
	for(i = 0; i <= min(sz[x], m); i++)
		ans[i] = ((ans[i] + dp[x][i][0]) % mod + dp[x][i][1]) % mod;
}

int main()
{
	int T, n, i, j, u, v, sum;
	scanf("%d", &T);
	while(T--)
	{
		scanf("%d%d", &n, &m);
		for(i = 1; i <= n; i++)
			e[i].clear();
		for(i = 1; i < n; i++)
		{
			scanf("%d%d", &u, &v);
			e[u].emplace_back(v);
			e[v].emplace_back(u);
		}
		for(i = 0; i <= m; i++)
			ans[i] = 0;
		dfs(1, 0);
		S[0][0] = 1;
		for(i = 1; i <= m; i++)
			for(j = 1; j <= i; j++)
				S[i][j] = (ll)(S[i - 1][j - 1] + S[i - 1][j]) * j % mod;
		sum = 0;
		for(i = 0; i <= m; i++)
			sum = (sum + (ll)S[m][i] * ans[i]) % mod;
		printf("%d\n", sum);
	}
	return 0;
}