import sys
sys.setrecursionlimit(10**7)

N = int(input())
G = [list() for _ in range(N)]
for i in range(N-1):
    u,v = map(int, input().split())
    u-=1;v-=1
    G[u].append(v)
    G[v].append(u)

depth = [0]*N
sub_tree = [0]*N
num = 0
def dfs(G, v, p, d):
    depth[v] = d
    for next_v in G[v]:
        if next_v == p:
            continue
        dfs(G, next_v, v, d+1)
    sub_tree[v] = 1
    for c in G[v]:
        if c== p:
            continue
        sub_tree[v] += sub_tree[c]
dfs(G,0,-1,0)
for i in range(1,N):
    s = sub_tree[i]
    num += s*(s-1)//2+(N-s)*(N-s-1)//2
mod = 998244353
n = (N-1)*N*(N-1)//2
print((num*pow(n,mod-2,mod))%mod)