import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')




# 拡張ユークリッド互除法

proc xgcd(a,b:int):(int,int,int)=
  var
    b = b
    x0=1
    y0=0
    x1=0
    y1=1
    q:int
    a = a
  while b!=0:
    (q,a,b) = (a.div(b),b,a.mod(b))
    (x0,x1)=(x1,x0-q*x1)
    (y0,y1)=(y1,y0-q*y1)
  return (a,x0,y0)

# modの逆元
proc modinv(a,m:int):int=
  var (g,x,y)=xgcd(a,m)
  if g!=1:
    return -1
  else:
    return ((x mod m)+m).mod(m)


const md = 998244353
proc solve()=
  var
    n =scan()
    es = newseqwith(n,newseq[int]())
    children = newseqwith(n,0)
  for i in 0..<n-1:
    var
      u = scan()-1
      v = scan()-1
    es[u].add(v)
    es[v].add(u)
  
  proc dfs(p,par:int):int=
    result=1
    for nxt in es[p]:
      if nxt == par:continue
      else:
        result+=dfs(nxt,p)
    children[p]=result
    return result

  discard dfs(0,-1)
  var
    pattern = 0
    d = ((n*(n-1)).div(2).mod(md)*(n-1)).mod(md).modinv(md)
  #echo children
  for p in 1..<n:
    pattern+=((n-children[p])*(n-children[p]-1)).div(2)+(children[p]*(children[p]-1)).div(2)
    pattern.mod=md
  #echo pattern
  
  echo ((pattern * d).mod(md)+md).mod(md)
  #echo d


  
  
solve()