#include<bits/stdc++.h>
using namespace std;
#define int long long
int mod=998244353;
signed main(){
	int N;cin>>N;
	vector<int>A(N);
	vector<int>B(N);
	int now=1;
	for(int i=0;i<N-1;i++){
		int a,b;cin>>a>>b;
		a--;
		b--;
		A[a]++;
		A[b]++;
		B[i]=now;
		now*=2;
		now%=mod;
	}
	int ans=0;
	for(int i=0;i<N;i++){
		ans+=(A[i]==N-1?(B[A[i]-1]*2+mod-2)%mod:B[A[i]]);
		//cout<<ans<<endl;
		ans%=mod;
	}
	cout<<ans<<endl;
}