#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int inv2 = (mod + 1) / 2;
const int N = 1e6 + 5;
int dp[N], n, vet[N], head[N], nxt[N], edgenum;
void Add(int u, int v) {
  vet[++edgenum] = v;
  nxt[edgenum] = head[u];
  head[u] = edgenum;
}
void dfs(int x, int fa) {
  dp[x] = 1;
  for (int e = head[x]; e; e = nxt[e]) {
    int v = vet[e];
    if (v == fa) continue;
    dfs(v, x);
    dp[x] = 1ll * dp[x] * (dp[v] + 1) % mod * inv2 % mod;
  }
  dp[x] = (1 - dp[x] + mod) % mod;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    Add(u, v), Add(v, u);
  }
  dfs(1, 0);
  int ans = 0;
  for (int i = 1; i <= n; i++) ans = (ans + 2ll * dp[i] % mod) % mod;
  for (int i = 1; i < n; i++) ans = 1ll * ans * 2 % mod;
  printf("%d\n", ans);
  return 0;
}
