#include <algorithm>
#include <iostream>

using namespace std;

constexpr int N = 2e5, mod = 998244353, phi = mod - 1, S = 1 << 15;

int pw2[S], pwS[S];

auto& add(auto&& a, auto b) { return a -= (a += b) >= mod? mod: 0; }
auto& mul(auto&& a, auto b) { return a = a * 1ull * b % mod; }
int pw(auto&& b) { return b -= b > phi? phi: 0, mul(+pw2[b % S], pwS[b / S]); }

bool vis[N];

basic_string<int> nei[N];

void walk(int v, int p) { vis[v] = 1; for (auto u: nei[v]) if (u != p) walk(u, v); }

int ord[N], szoth;

int ft[N];

void inc(int i) { for (i = N - i - 1; i < N; i |= i + 1) ++ft[i]; }
int que(int i) { int x = 0; for (i = N - i - 1; i; i &= i - 1) x += ft[i - 1]; return x; }

int cd[N], ss[N];

void down(int v, int p) {
  int t;
  cd[v] -= t = que(v), inc(v);
  for (auto u: nei[v]) if (u != p) down(u, v), (ss[v] += ss[u] + cd[u]) %= phi, cd[u] -= t, cd[u] += t = que(v);
  cd[v] += t;
}

void up(int v, int p) {
  for (auto u: nei[v]) if (u != p) {
    ss[u] = (szoth - ord[v] + ss[v] + phi - cd[u]) % phi;
    up(u, v);
  }
}

int ans;

void solve(int v, int p, int cur) {
  add(ans, pw(cur));
  for (auto u: nei[v]) if (u != p) solve(u, v, cur + szoth - ord[u]);
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  for (int i = 0, p = 1; i < S; ++i) pw2[i] = p, add(p, p);
  for (int i = 0, p = 1, t = mul(2, pw2[S - 1]); i < S; ++i) pwS[i] = p, mul(p, t);
  int n; cin >> n;
  for (int i = 2, a, b; i < n; ++i) cin >> a >> b, nei[--a].push_back(--b), nei[b].push_back(a);
  walk(0, 0);
  int r;
  for (int i = 0; i < n; ++i) ord[i] = ord[i - !!i] + !vis[i], r = vis[i]? r: i;
  szoth = ord[n - 1];
  down(0, 0);
  down(r, r);
  up(r, r);
  int c = 0;
  for (int i = 0, j = szoth; i < n; ++i) if (!vis[i]) add(c, pw(--j + ss[i] + ss[0]));
  solve(0, 0, 0);
  cout << add(mul(ans, c), (szoth == 1) * pw(ss[0])) << '\n';
}