#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 5;
const int mod = 998244353;
int add(int x, int y) {
  x += y;
  while (x >= mod) x -= mod;
  return x;
}
int mul(int x, int y) {
  long long z = 1LL * x * y;
  return z - z / mod * mod;
}
vector<int> g[maxn];
int n, p[maxn], sz[maxn], dp[maxn][2], w;
void dfs(int u, int fa) {
  dp[u][0] = 1;
  sz[u] = 1;
  for (auto v : g[u]) {
    if (v == fa) continue;
    dfs(v, u);
    dp[u][1] = mul(dp[u][1], mul(add(dp[v][1], dp[v][0]), 2));
    dp[u][1] = add(dp[u][1], mul(dp[u][0], dp[v][1]));
    dp[u][0] = mul(dp[u][0], add(dp[v][1], mul(dp[v][0], 2)));
    sz[u] += sz[v];
  }
  w = add(w, mul(dp[u][1], p[n - sz[u]]));
  swap(dp[u][0], dp[u][1]);
}
int main() {
  int i, u, v;
  scanf("%d", &n);
  for (i = p[0] = 1; i <= n; i++) p[i] = mul(p[i - 1], 2);
  for (i = 1; i < n; i++) {
    scanf("%d%d", &u, &v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1, 0);
  printf("%d\n", mul(w, 2));
  return 0;
}
