#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
const int Mod = 998244353, div2 = (Mod + 1) / 2;
int n, ans;
vector<int> G[N];
int DFS(int o, int f) {
  int P = 1;
  for (int v : G[o]) {
    if (v == f) continue;
    int w = DFS(v, o);
    P = 1ll * (2 - w) * div2 % Mod * P % Mod;
  }
  ans = (ans + (1 - P) * 2ll) % Mod;
  return P;
}
int main() {
  scanf("%d", &n);
  for (int i = 2; i <= n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    G[u].push_back(v), G[v].push_back(u);
  }
  DFS(1, 0);
  ans = (ans + Mod) % Mod;
  for (int i = 1; i <= n - 1; i++) ans = ans * 2ll % Mod;
  printf("%d\n", ans);
  return 0;
}
