#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int mxN = 500010;
long long dp[mxN];
vector<int> g[mxN];
long long inv2;
long long pow_mod(long long base, long long power) {
  long long res = 1;
  while (power) {
    if (power & 1) res = res * base % mod;
    base = base * base % mod;
    power >>= 1;
  }
  return res;
}
long long res;
void dfs(int u = 0, int p = -1) {
  long long cur = 1;
  for (auto v : g[u])
    if (v != p) {
      dfs(v, u);
      cur *= ((1 - (1 - dp[v]) * inv2) % mod + mod) % mod;
      cur = (cur % mod + mod) % mod;
    }
  dp[u] = (1 + mod - cur) % mod;
  res = (res + dp[u]);
  if (res >= mod) res -= mod;
}
int main(int argc, char** argv) {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  inv2 = pow_mod(2, mod - 2);
  int N, u, v;
  cin >> N;
  for (int i = 1; i < N; i++) {
    cin >> u >> v;
    u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs();
  res = res * pow_mod(2, N) % mod;
  cout << res << '\n';
  return 0;
}
