def solve():
	N = int(input())
	G = [[] for i in range(N)]
	for i in range(N-1):
		u, v = map(int, input().split())
		u -= 1; v -= 1;
		G[u].append(v)
		G[v].append(u)
	ans = 0
	for v in range(N):
		for u in G[v]:
			ans += (len(G[v])-1) * (len(G[u])-1)
	print((ans//2)%998244353)

for _ in range(int(input())):
	solve()