## https://yukicoder.me/problems/no/1507

from collections import deque

MOD = 998244353

def main():
    N = int(input())
    next_nodes = [[] for _ in range(N)]
    for _ in range(N - 1):
        u, v = map(int, input().split())
        next_nodes[u - 1].append(v - 1)
        next_nodes[v - 1].append(u - 1)

    answer = 0
    child_num = [0] * N
    parents = [-2] * N
    stack = deque()
    stack.append((0, 0))
    parents[0] = -1
    inv2 = pow(2, MOD - 2, MOD)

    pp = (N * (N - 1)) % MOD
    pp *= inv2
    pp %= MOD
    pp = pow(pp, MOD - 2, MOD)
    p_n = pow(N - 1, MOD - 2, MOD)

    while len(stack) > 0:
        v, index = stack.pop()

        while index < len(next_nodes[v]):
            w = next_nodes[v][index]
            if w == parents[v]:
                index += 1
                continue

            parents[w] = v
            stack.append((v, index + 1))
            stack.append((w, 0))
            break

        if index == len(next_nodes[v]):
            c = 1 + child_num[v]
            d = N - c

            p = (c * (c - 1)) % MOD
            p += (d * (d - 1)) % MOD
            p *= inv2
            p %= MOD
            p *= pp
            p %= MOD

    
            if parents[v] != -1:
                answer += (p * p_n) % MOD
                answer %= MOD
                child_num[parents[v]] += 1 + child_num[v]
    
    print(answer)

            

            

    


        




if __name__ == "__main__":
    main()