import sys
sys.setrecursionlimit(10**9)
N=int(input())
E=[]
G=[[] for _ in range(N)]
for _ in range(N-1):
  u,v=map(lambda x:int(x)-1,input().split())
  E.append((u,v))
  G[u].append(v)
  G[v].append(u)
subtree_size=[1]*N
def dfs(G,v,p=-1):
  for nextv in G[v]:
    if nextv!=p:
      dfs(G,nextv,v)
  for c in G[v]:
    if c!=p:
      subtree_size[v]+=subtree_size[c]
dfs(G,0)
p=0
for u,v in E:
  n=min(subtree_size[u],subtree_size[v])
  # print(u,v,n)
  p+=n*(n-1)//2+(N-n)*(N-n-1)//2
q=N*(N-1)//2*(N-1)
while q%998244353==0:
  p//=998244353
  q//=998244353
# print(p,q)
def extgcd(a,b):
  if b:
    d,y,x=extgcd(b,a%b)
    y-=(a//b)*x
    return d,x,y
  return a,1,0
print(p*extgcd(q,998244353)[1]%998244353)