import sys
sys.setrecursionlimit(2*10**5)
n = int(input())
e = [[] for i in range(n)]
for i in range(n-1):
    a,b = map(int,input().split())
    a -= 1
    b -= 1
    e[a].append(b)
    e[b].append(a)

mod = 998244353
count = [0]*n
def dfs(x,p=-1):
    c = 1
    for nex in e[x]:
        if nex == p:
            continue
        c += dfs(nex,x)
    count[x] = c
    return c

dfs(0,-1)
all = n*(n-1)//2*(n-1)
ans = all
for i in range(n):
    for j in e[i]:
        if count[j] > count[i]:
            continue
        ans -= count[j]*(n-count[j])

m = pow(all,mod-2,mod)
print(ans*m%mod)