#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
vector<int> adj[500010];
int n, pw[500010], sz[500010], a[500010], b[500010];
void dfs(int x, int p) {
  sz[x] = 1, b[x] = 1;
  for (int i = 0; i < adj[x].size(); i++) {
    int y = adj[x][i];
    if (y == p) continue;
    dfs(y, x);
    sz[x] += sz[y];
    b[x] = 1ll * b[x] * (pw[sz[y] - 1] + b[y]) % mod;
  }
  b[x] = pw[sz[x] - 1] - b[x];
  if (b[x] < 0) b[x] += mod;
}
int main() {
  pw[0] = 1;
  for (int i = 1; i < 500010; i++) pw[i] = pw[i - 1] * 2 % mod;
  scanf("%d", &n);
  for (int i = 1, x, y; i < n; i++) {
    scanf("%d%d", &x, &y);
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  dfs(1, 0);
  int ans = 0;
  for (int i = 1; i <= n; i++) ans = (ans + 2ll * b[i] * pw[n - sz[i]]) % mod;
  printf("%d\n", ans);
}
