from collections import deque

INF = 10**9
MOD = 998244353


def solve():
    N = int(input())
    graph = [[] for _ in range(N)]

    for _ in range(N - 1):
        U, V = [int(x) - 1 for x in input().split()]
        graph[U].append(V)
        graph[V].append(U)

    def bfs(start):
        dist = [INF] * N
        dist[start] = 0

        que = deque([start])

        while len(que) > 0:
            curr = que.popleft()

            for to in graph[curr]:
                if dist[to] < INF:
                    continue
                dist[to] = dist[curr] + 1
                que.append(to)

        return len([i for i in range(N) if dist[i] == 3])

    ans = 0
    for i in range(N):
        ans += bfs(i)
        ans %= MOD

    ans //= 2

    print(ans)


if __name__ == "__main__":
    T = int(input())
    for _ in range(T):
        solve()