import sys
sys.setrecursionlimit(10**6)
n=int(input())
mod=998244353
q=pow((n-1)*(n-1)*n//2,mod-2,mod)
path=[[] for _ in range(n)]
p2=[]
for i in range(n-1):
    a,b=map(int,input().split())
    path[a-1].append(b-1)
    path[b-1].append(a-1)
    p2.append([a-1,b-1])
s=[1]*n
seen=[False]*n
def dfs(t):
    global seen,s
    for i in path[t]:
        if not seen[i]:
            seen[i]=True
            s[t]+=dfs(i)
    return s[t]
seen[0]=True
s[0]=dfs(0)
p=0
m=(n-1)*n//2
for i in p2:
    t=min(s[i[0]],s[i[1]])
    p+=m-t*(n-t)
print(p*q%mod)