MOD = 998244353
N = int(input())
G = {i:[] for i in range(1,N+1)}
for _ in range(N-1):
    a,b = map(int,input().split())
    G[a].append(b)
    G[b].append(a)
depth = 0
vmax = 0
def dfs(i,p,cnt):
    global depth,vmax
    if cnt>depth:
        depth = cnt
        vmax = i
    for j in G[i]:
        if j==p:continue
        dfs(j,i,cnt+1)
dfs(1,0,0)
dfs(vmax,0,0)
ans = 0
for i in range(1,N+1):
    ans = (ans+pow(2,len(G[i]),MOD))%MOD
if depth==2:
    print((ans-1)%MOD)
else:
    print(ans)