def tree_dfs(g, root=0):
    s = [root]
    d = [1] * len(g)
    order = []
    while s:
        p = s.pop()
        d[p] = 0
        order.append(p)
        for node in g[p]:
            if d[node]:
                s.append(node)
    return order

MOD = 998244353
n = int(input())
g = [[] for _ in range(n)]
for i in range(n - 1):
    a, b = map(int, input().split())
    g[a - 1].append(b - 1)
    g[b - 1].append(a - 1)
order = tree_dfs(g)
d = [0] * (n + 1)
for v in order[::-1]:
    for node in g[v]:
        d[v] += d[node]
    d[v] += 1
ans = 0
for v in range(1, n):
    ans += d[v] * (d[v] - 1) * pow(2, MOD - 2, MOD) + (n - d[v]) * (n - d[v] - 1) * pow(2, MOD - 2, MOD)
print((ans * pow(n * (n - 1) * pow(2, MOD - 2, MOD), MOD - 2, MOD) * pow(n - 1, MOD - 2, MOD)) % MOD)