import sys
sys.setrecursionlimit(10**5+10)
input = sys.stdin.readline

def dfs(v, pv=-1):
    for nv in G[v]:
        if nv==pv:
            continue
        
        dfs(nv, v)
        num[v] += num[nv]

N = int(input())
G = [[] for _ in range(N)]
edges = []

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

num = [1]*N
dfs(0)
ans = 0
MOD = 998244353

for u, v in edges:
    if num[u]<num[v]:
        ans += num[u]*(num[u]-1)//2+(N-num[u])*(N-num[u]-1)//2
    else:
        ans += num[v]*(num[v]-1)//2+(N-num[v])*(N-num[v]-1)//2

ans *= pow(N*(N-1)**2*pow(2, MOD-2, MOD), MOD-2, MOD)
print(ans%MOD)