#include <bits/stdc++.h>
using namespace std;
using ll=long long;

const int N=2e5, mod=998244353;

ll fpow(ll b, ll p)
{
  ll ret=1;
  while(p)
  {
    if(p&1)
      ret = ret * b % mod;
    b=b*b%mod;
    p/=2;
  }
  return ret;
}

int a[N];
int main()
{
  int n;
  cin>>n;
  for(int i=0, x, y; i<n-1; i++)
  {
    cin >> x >> y;
    a[x]++, a[y]++;
  }
  
  ll ans=0;
  for(int i=1; i<=n; i++)
    ans = (ans + fpow(2, a[i]) - (a[i]==n-1? 2: 0))%mod;
  cout << ans;
    
}