#include <atcoder/modint.hpp>
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
  int N;
  cin >> N;
  vector<vi> G(N);
  rep(i, N - 1) {
    int A, B;
    cin >> A >> B;
    --A, --B;
    G[A].push_back(B);
    G[B].push_back(A);
  }
  vi par(N, -1), subt(N, 1);
  auto dfss = [&](auto f, int v, int p) -> int {
    for (int u : G[v]) {
      if (u != p) {
        par[u] = v;
        subt[v] += f(f, u, v);
      }
    }
    return subt[v];
  };

  dfss(dfss, 0, -1);

  using mint = atcoder::modint998244353;
  mint ans = 0;
  rep(v, N) {
    mint x = 2;
    for (auto u : G[v]) {
      if ((u != par[v] && subt[u] > 1) || (u == par[v] && subt[v] < N - 1))
        x = 0;
    }
    ans += mint(2).pow(sz(G[v])) - x;
  }
  cout << ans.val() << '\n';
}