#include <bits/stdc++.h>
using namespace std;
const int maxn = 500005, mod = 998244353, inv2 = (mod + 1) / 2;
int n, pw, ans;
int f[maxn];
vector<int> v[maxn];
void dfs(int x, int last) {
  f[x] = 1;
  for (int i = 0; i < v[x].size(); i++) {
    int y = v[x][i];
    if (y == last) continue;
    dfs(y, x);
    f[x] = 1ll * f[x] * (inv2 + 1ll * (1 - f[y] + mod) * inv2 % mod) % mod;
  }
  ans = (ans + (1 - f[x] + mod) % mod) % mod;
}
int main() {
  scanf("%d", &n), pw = 1;
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    v[x].push_back(y), v[y].push_back(x);
    pw = (pw + pw) % mod;
  }
  dfs(1, 0);
  printf("%d\n", 2ll * ans * pw % mod);
  return 0;
}
