n=int(input())
e=[[] for i in range(n)]
for i in range(n-1):
  u,v=map(int,input().split())
  u-=1
  v-=1
  e[u]+=[v]
  e[v]+=[u]
M=998244353
a=0
v=[0]*n
u=[0]*n
q=[0]
while len(q)>0:
  s=q[-1]
  if v[s]==0:
    v[s]=1
    q+=[t for t in e[s] if v[t]==0]
  else:
    u[s]=1+sum(u[t] for t in e[s] if v[t]==0)
    g=[]
    g+=[int(u[t]>1) for t in e[s] if v[t]==0]
    g+=[int(n-u[s]>1) for t in e[s] if v[t]==1]
    if 1 not in g:
      a+=pow(2,len(e[s]),M)-2
    else:
      a+=pow(2,len(e[s]),M)
    v[s]=0
    q.pop()
print(a%M)