#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int n = 0;
  char c;
  for (c = getchar(); c < '0' || c > '9'; c = getchar())
    ;
  for (; c >= '0' && c <= '9'; c = getchar()) n = n * 10 + c - 48;
  return n;
}
const int maxn = 5e5 + 5, mo = 998244353, re1 = ((mo + 1) >> 1) - 1;
int i, j, n, f[maxn], two;
long long sum;
vector<int> g[maxn];
void dfs(int x, int fa) {
  int s = 1;
  for (int i = 0; i < g[x].size(); i++) {
    int y = g[x][i];
    if (y == fa) continue;
    dfs(y, x);
    s = ((long long)f[y] * re1 % mo + 1) * s % mo;
  }
  f[x] = s, sum += 1 - s;
}
int main() {
  n = read();
  two = 1;
  for (i = 1; i <= n; i++) two = (two << 1) % mo;
  for (i = 1; i <= n - 1; i++) {
    int x = read(), y = read();
    g[x].push_back(y), g[y].push_back(x);
  }
  dfs(1, 0);
  printf("%d\n", (long long)(sum % mo + mo) * two % mo);
}
