import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N = I()
Graph = [[] for _ in range(N+1)]
edges = []
for _ in range(N-1):
    u,v = MI()
    Graph[u].append(v)
    Graph[v].append(u)
    edges.append((u,v))
mod = 998244353


def dp(i,par):
    res = 1
    for j in Graph[i]:
        if j == par:
            continue
        res += dp(j,i)
    subtree[i] = res
    return res


subtree = [0]*(N+1)
dp(1,0)

inv = pow(N*(N-1)**2,mod-2,mod)
ans = 1
for u,v in edges:
    a = subtree[u]
    b = subtree[v]
    m = min(a,b)
    ans -= 2*m*(N-m)*inv
    ans %= mod

print(ans)