#include <bits/stdc++.h>
using namespace std;
const int mo = 998244353;
const int I2 = (mo + 1) / 2;
const int N = 500005;
struct edge {
  int to, next;
} e[N * 2];
int head[N], f[N];
int tot, n, ans;
void add(int x, int y) {
  e[++tot] = (edge){y, head[x]};
  head[x] = tot;
}
void dfs(int x, int fa) {
  f[x] = 1;
  for (int i = head[x]; i; i = e[i].next)
    if (e[i].to != fa) {
      dfs(e[i].to, x);
      int dif = 1ll * f[e[i].to] * I2 % mo * f[x] % mo;
      ans = (ans + dif) % mo;
      f[x] = (f[x] + mo - dif) % mo;
    }
}
int main() {
  scanf("%d", &n);
  for (int i = (int)(1); i <= (int)(n - 1); i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    add(x, y);
    add(y, x);
  }
  dfs(1, 0);
  for (int i = (int)(1); i <= (int)(n); i++) ans = 2ll * ans % mo;
  printf("%d\n", ans);
}
