#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
  int v = 0, f = 1;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = (c & 15);
  while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15);
  x = v * f;
}
inline void read(long long &x) {
  long long v = 0ll, f = 1ll;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-')
    f = -1;
  else
    v = (c & 15);
  while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15);
  x = v * f;
}
inline void readc(char &x) {
  char c;
  while (((c = getchar()) == ' ') || c == '\n')
    ;
  x = c;
}
const int mod = 998244353, inv2 = (mod + 1) / 2;
int n, m, i, j, dp[500005][2], ans, pw[500005], f[500005];
vector<int> e[500005];
void dfs(int x, int p) {
  dp[x][0] = 1;
  f[x] = 0;
  for (__typeof((e[x]).begin()) it = (e[x]).begin(); it != (e[x]).end(); it++)
    if (*it != p) {
      dfs(*it, x);
      f[x] += f[*it] + 1;
      long long t0 =
          (2ll * dp[x][0] * dp[*it][1] % mod + 1ll * dp[x][0] * dp[*it][0]) %
          mod;
      long long t1 = (2ll * dp[x][1] * (dp[*it][1] + dp[*it][0]) % mod +
                      1ll * dp[x][0] * dp[*it][0]) %
                     mod;
      dp[x][0] = t0;
      dp[x][1] = t1;
    }
  ans = (ans + 1ll * dp[x][1] * pw[(n - 1 - f[x])]) % mod;
}
int main() {
  pw[0] = 1;
  for (((i)) = (1); ((i)) <= ((500000)); ((i))++) pw[i] = 2ll * pw[i - 1] % mod;
  read(n);
  for (((i)) = (1); ((i)) <= ((n - 1)); ((i))++) {
    int x, y;
    read(x);
    read(y);
    e[x].push_back(y);
    e[y].push_back(x);
  }
  dfs(1, 0);
  cout << 2ll * ans % mod;
  return 0;
}
