import sys
input = sys.stdin.readline
N = int(input())
e = [[] for _ in range(N + 1)]
for _ in range(N - 1):
  u, v = map(int, input().split())
  e[u].append(v)
  e[v].append(u)

mod = 998244353

s = [1]
vis = [0] * (N + 1)
parent = [0] * (N + 1)
vis[1] = 1
order = []
while len(s):
  x = s.pop()
  order.append(x)
  for y in e[x]:
    if vis[y]: continue
    parent[y] = x
    vis[y] = 1
    s.append(y)

size = [1] * (N + 1)
order.reverse()
for y in order[: -1]:
  x = parent[y]
  size[x] += size[y]

res = 0
for y in range(2, N + 1):
  x = parent[y]
  u = N - size[y]
  d = size[y]
  res += u * d
  res %= mod
  #print(y, u, d)

res *= pow(N * (N - 1) * (N - 1) // 2, mod - 2, mod)
res %= mod
print((1 - res) % mod)