import io,os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
from collections import deque 



M = 998244353

def fastfrac(a,b):
    numb = pow(b,M-2,M)
    return ((a%M)*(numb%M))%M




def main():
    n = int(input())

    neigh = [[] for _ in range(n)]
    for _ in range(n-1):
        u,v = map(int,input().split())
        neigh[u-1].append(v-1)
        neigh[v-1].append(u-1)

    children = [[] for _ in range(n)]


    parent = [-2]*n
    subnum = [0]*n

    subnum2 = [0]*n
    layer = [0]*n


    parent[0] = -1



    queue = deque()

    queue.append(0)

    seq = []
    while queue:
        index = queue.popleft()
        seq.append(index)
        for nextindex in neigh[index]:
            if parent[nextindex] > -2:  continue 
            parent[nextindex] = index
            children[index].append(nextindex)
            queue.append(nextindex)
            layer[nextindex] = layer[index] + 1






    for index in seq[::-1]:
        subnum[index] = 1
        for nextindex in children[index]:
            subnum[index] += subnum[nextindex]
            subnum2[index] += subnum2[nextindex]
 
        subnum2[index] += subnum[index] ** 2
     


    
    
    base = 0
    for i in range(n):
        base += subnum[i] ** 2

    
    diff = [0]*n

#    print(subnum)

    ans1 = 0
    ans2 = 0
    for index in seq[1:]:
        p = parent[index]
        diff[index] = diff[p] + (n - subnum[index])**2  - subnum[p] ** 2
        
        end = base - subnum2[index] - subnum[p]**2 + diff[p]
        ans1 += (subnum[index] * (n - subnum[index]) % M) ** 2 % M
        ans2 +=  (subnum[index] ** 2 % M) * end % M
        ans2 += (subnum2[index] - subnum[index] ** 2) * (n - subnum[index]) ** 2 % M
        ans1 %= M
        ans2 %= M


#    print("ans12",ans1,ans2)    
       
    div = (n * (n-1) // 2) ** 2 % M



    ans = (ans1 + ans2)%M
    ans = fastfrac(ans, div)


     

   


    

        
    print(ans)
        
    






T = int(input())
t = 1
while t <= T:
    main()
    t += 1