import sys
input = sys.stdin.readline
from collections import deque
class Tree:
  def __init__(self, N):
    self.V = N
    self.edge2 = [[] for _ in range(N)]
    self.edge = [deque([]) for _ in range(N)]
    self.order = []
  
  def add_edges(self, ind=1, bi=True):
    for i in range(self.V-1):
      a,b = map(int, input().split())
      a -= ind; b -= ind
      self.edge[a].append(b)
      self.edge2[a].append(b)
      if bi:
        self.edge[b].append(a)
        self.edge2[b].append(a)

  def add_edge(self, a, b, bi=True):
    self.edge[a].append(b)
    if bi: self.edge[b].append(a)

  def dp(self, start):
    stack = deque([start])
    self.parent = [self.V]*self.V; self.parent[start] = -1
    self.order.append(start)
    #記録したい値の配列を定義
    self.dp = [1]*self.V
    while stack:
      v = stack[-1]
      while len(self.edge[v]):
        u = self.edge[v].popleft()
        if u==self.parent[v]: continue
        self.parent[u]=v
        stack.append(u); self.order.append(u)
        break
      else:
        stack.pop()
    for v in self.order[::-1]:
      for u in self.edge2[v]:
        if u==self.parent[v]: continue
        self.dp[v] += self.dp[u] #帰りがけ処理
  
  def bfs(self, start):
    d = deque([start])
    self.min_cost = [-1]*self.V; self.min_cost[start]=0
    while len(d)>0:
      v = d.popleft()
      for w in self.edge[v]:
        if self.min_cost[w]==-1:
          self.min_cost[w]=self.min_cost[v]+1
          d.append(w)
    return

N = int(input())
G = Tree(N)
G.add_edges(ind=1, bi=True)
G.dp(0)
ans = 0
MOD = 998244353
for i in range(1,N):
  num = G.dp[i]
  ans += num*(num-1) + (N-num)*(N-num-1)
ans *= pow(N*(N-1)*(N-1), MOD-2, MOD)
print(ans%MOD)