#include <bits/stdc++.h>
const long long mod = 998244353;
const long long inv2 = (mod + 1) / 2;
const int maxn = 5E+5 + 5;
int n;
long long ans, dp[maxn];
std::vector<int> to[maxn];
inline void DFS(int u, int fa) {
  long long prod = 1;
  for (int v : to[u]) {
    if (v == fa) continue;
    DFS(v, u);
    prod = prod * (1 + dp[v]) % mod * inv2 % mod;
  }
  dp[u] = (1 - prod) % mod;
  (ans += dp[u]) %= mod;
}
int main() {
  scanf("%d", &n);
  long long pw = 2;
  for (int i = 1, u, v; i < n; ++i) {
    scanf("%d%d", &u, &v);
    to[u].push_back(v);
    to[v].push_back(u);
    pw = pw * 2 % mod;
  }
  DFS(1, 0);
  printf("%lld", (ans + mod) % mod * pw % mod);
}
