#include <bits/stdc++.h>
using namespace std;
long long gi() {
  char cc = getchar();
  long long cn = 0, flus = 1;
  while (cc < '0' || cc > '9') {
    if (cc == '-') flus = -flus;
    cc = getchar();
  }
  while (cc >= '0' && cc <= '9') cn = cn * 10 + cc - '0', cc = getchar();
  return cn * flus;
}
const long long N = 5e5 + 5;
const long long P = 998244353;
long long n, Ans, sz[N], fac[N], f[N][2];
vector<long long> G[N];
void add(long long x, long long y) { G[x].push_back(y), G[y].push_back(x); }
void dfs(long long x, long long fa) {
  sz[x] = 1, f[x][0] = 1;
  for (long long v : G[x]) {
    if (v == fa) continue;
    dfs(v, x), sz[x] += sz[v];
    f[x][0] = f[x][0] * (f[v][0] + f[v][1] + f[v][1]) % P;
  }
  f[x][1] = (fac[sz[x] - 1] - f[x][0] + P) % P;
  Ans = (Ans + f[x][1] * fac[n - sz[x]]) % P;
}
signed main() {
  n = gi();
  long long x, y;
  for (register long long i = (2); i <= (n); ++i) x = gi(), y = gi(), add(x, y);
  fac[0] = 1;
  for (register long long i = (1); i <= (n); ++i) fac[i] = fac[i - 1] * 2 % P;
  dfs(1, 1);
  cout << Ans * 2 % P << endl;
  return 0;
}
