/* -*- coding: utf-8 -*-
 *
 * 1507.cc:  No.1507 Road Blocked - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MOD = 998244353;

/* typedef */

typedef long long ll;
typedef vector<int> vi;

/* global variables */

vi nbrs[MAX_N];
int ps[MAX_N], cis[MAX_N], ss[MAX_N];

/* subroutines */

int powmod(int a, int n) {  // a^n % MOD
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % MOD;
    a = (ll)a * a % MOD;
    n >>= 1;
  }
  return pm;
}

inline int p2(int n) { return (ll)n * (n - 1) % MOD; }

/* main */

int main() {
  int n;
  scanf("%d", &n);

  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    nbrs[u].push_back(v);
    nbrs[v].push_back(u);
  }

  int sum = 0;
  ps[0] = -1;
  for (int u = 0; u >= 0;) {
    vi &nbru = nbrs[u];
    int up = ps[u];
    if (cis[u] < nbru.size()) {
      int v = nbru[cis[u]++];
      if (v != up) {
	ps[v] = u;
	u = v;
      }
    }
    else {
      ss[u]++;
      if (up >= 0) {
	ss[up] += ss[u];

	sum = (sum + (p2(ss[u]) + p2(n - ss[u])) % MOD) % MOD;
      }
      u = up;
    }
  }

  int num = (ll)p2(n) * (n - 1) % MOD;

  printf("%lld\n", (ll)sum * powmod(num, MOD - 2) % MOD);
  return 0;
}