#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vvi adj(n);
    vi d(n, 0);
    rep(i, n-1){
        int a, b; cin >> a >> b;
        a--; b--;
        d[a]++; d[b]++;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    int uni = 0;
    rep(i, n){
        bool f = true;
        for(auto j : adj[i]){
            f = f && (d[j] == 1);
        }
        if(f)uni++;
    }
    mint ans = 0;
    rep(i, n){
        ans += mint(2).pow(d[i]);
    }cout << (ans-mint(2*uni)).val() << endl;

    return 0;
}