#include <bits/stdc++.h>
#define int ll
#define For(i, l, r) for (int i=l; i<=r; ++i)
using namespace std;
typedef long long ll;
template <typename T>
inline void read(T &x) {
	char c = getchar(); int w = 1; x = 0;
	while (!isdigit(c))
		(c == '-') && (w = -w), c = getchar();
	while (isdigit(c))
		x = (x << 1) + (x << 3) + (c ^ '0'), c = getchar();
	x *= w;
}

const int N = 100010;
const ll mod = 998244353;
int n, val[N][3], siz[N], musiz[N], Ans;
vector<int> G[N];
inline void dfs(int u, int fa) {
	siz[u] = 1;
	for (auto v : G[u]) {
		if (v == fa) continue;
		dfs(v, u);
		siz[u] += siz[v];
		(val[u][0] += val[v][0]) %= mod;
		val[u][1] += (val[v][1]+val[v][0]);
		val[u][1] %= mod;
		(val[u][2] += (val[v][2] + val[v][1]*2 + val[v][0])) %= mod;
	}
	for (auto v : G[u]) {
		if (v == fa) continue;
		musiz[u] += siz[v] * (siz[u]-1-siz[v]);
		musiz[u] %= mod;
	}
	for (auto v : G[u]) {
		if (v == fa) continue;
		val[u][0] += siz[v] * (siz[u]-1-siz[v]);
		val[u][0] %= mod;
		val[u][1] += siz[v] * (siz[u]-1-siz[v]);
		val[u][1] %= mod;
		val[u][2] += siz[v] * (siz[u]-1-siz[v]);
		val[u][2] %= mod;
		Ans = (Ans + val[v][2] * ((musiz[u]-siz[v]*(siz[u]-1-siz[v]))+(n-siz[u])*(siz[u]-1-siz[v])*2+1+(n-siz[v]-1)*2) % mod) % mod;
	}
	(val[u][0] += 1 + (siz[u]-1) * 2) %= mod;
	(val[u][1] += 1 + (siz[u]-1) * 2) %= mod;
	(val[u][2] += 1 + (siz[u]-1) * 2) %= mod;
}
inline ll qpow(ll x, ll y) {
	ll res = 1;
	while (y) {
		if (y & 1) res = res * x % mod;
		x = x * x % mod; y >>= 1;
	}
	return res;
}
signed main() {
	int T;
	//cout << 1ll*918384806*(25 % mod) % mod << endl;
	read(T);
	while (T -- > 0) {
		read(n);
		For(i, 1, n) {
			G[i].clear();
			val[i][0] = val[i][1] = val[i][2] = 0;
			siz[i] = musiz[i] = 0;
		}
		For(i, 1, n-1) {
			int u, v;
			read(u); read(v);
			G[u].push_back(v);
			G[v].push_back(u);
		}
		Ans = 0;
		dfs(1, 0);
		Ans = Ans * (qpow(n*(n-1)/2, mod-2) * qpow(n*(n-1)/2, mod-2) % mod) % mod;
		printf("%lld\n", Ans);
	}
	return 0;
}