#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int const N = 5e5 + 20, mod = 998244353, inv2 = (mod + 1) >> 1;
int n, f[N], ans;
vector<int> g[N];
void dfs(int v, int par = -1) {
  f[v] = 1;
  for (int u : g[v]) {
    if (u == par) continue;
    dfs(u, v);
    f[v] = (1 - 1ll * f[u] * inv2 % mod + mod) * f[v] % mod;
  }
  ans = (ans + 1 - f[v] + mod) % mod;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 0, u, v; i < n - 1; i++) {
    cin >> u >> v;
    u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(0);
  for (int i = 0; i < n; i++) ans = 2 * ans % mod;
  cout << ans << '\n';
}
