import sys
sys.setrecursionlimit(10**7)


def dfs(u, p):
    global ans
    for v in g[u]:
        if v == p:
            continue
        dfs(v, u)
        for i in range(3):
            ans += dp[i][u] * dp[2 - i][v]
            ans %= mod
        for i in range(1, 4):
            dp[i][u] += dp[i - 1][v]
            dp[i][u] %= mod

T = int(input())
mod = 998244353
for _ in range(T):
    N = int(input())
    g = [[] for _ in range(N)]
    for _ in range(N - 1):
        u, v = map(int, input().split())
        u, v = u - 1, v - 1
        g[u].append(v)
        g[v].append(u)
    dp = [[0] * N for _ in range(4)]
    dp[0] = [1] * N
    ans = 0
    dfs(0, -1)
    print(ans)