#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];

ll res, p[N];
int sz[N];
int main() {
    p[0] = 1;
    for (int i = 1; i < N; i++) p[i] = (p[i - 1] << 1) % MOD;
    scanf("%d", &n);
    for (int i = 1, a, b; i < n; i++) {
        scanf("%d%d", &a, &b);
        sz[a]++, sz[b]++;
    }
    for (int i = 1; i < n + 1; i++) {
        res -= (sz[i] == n - 1) << 1;
        res = (res + p[sz[i]] + MOD) % MOD;
    }
    printf("%lld\n", res);
    return 0;
}