#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int MAX_N = 500500;
constexpr int MOD = 998244353;
int n;
vector<int> adj[MAX_N];
int ans[MAX_N];
ll pow2[MAX_N];
ll pow2_inv[MAX_N];
int dfs(int u, int p) {
  int num_children = 0;
  ll prod = 1LL;
  for (int v : adj[u]) {
    if (v == p) continue;
    ++num_children;
    prod = (prod * (1 + dfs(v, u))) % MOD;
  }
  ans[u] = (1 - (pow2_inv[num_children] * prod) % MOD + MOD) % MOD;
  return ans[u];
}
int main() {
  scanf(" %d", &n);
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    scanf(" %d %d", &u, &v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  int mini = (MOD + 1) / 2;
  pow2[0] = 1;
  pow2_inv[0] = 1;
  for (int i = 1; i < MAX_N; ++i) {
    pow2[i] = (pow2[i - 1] * 2) % MOD;
    pow2_inv[i] = (pow2_inv[i - 1] * mini) % MOD;
  }
  dfs(1, 1);
  ll tot = 0LL;
  for (int u = 1; u <= n; ++u) {
    tot = (tot + ans[u]) % MOD;
  }
  tot = (tot * pow2[n]) % MOD;
  printf("%lld\n", tot);
  return 0;
}
