#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)







vector<ll> g[200010];

const ll MOD=998244353;
ll f(ll x,ll n){
    ll res=1;
    while(n!=0LL){
	if(n%2!=0LL) res=(res*x)%MOD;
	x=(x*x)%MOD;
	n/=2;
   }
    return res;
}





int main() {
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;




	ll N;
	cin >> N;
	REP(i,N-1){

		ll a,b;
		cin >> a >> b;

		g[a].push_back(b);
		g[b].push_back(a);

	}


	ll ans=0;
	for(i=1;i<=N;i++){

		ll n=g[i].size();

		ans+=f(2,n);
		if(n+1==N) ans-=2;

		ans%=MOD;


	}


	cout << ans << endl;










    return 0;
}