#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

int n;
VVI to;
mint ans;
const mint inv2 = mint(1) / 2;
int dfs(int u, int p = -1) {
    int sz = 1;
    for(int v: to[u]) if (v != p) {
        int s = dfs(v, u);
        mint t1 = s;
        mint t2 = n - t1;
        ans += t1 * (t1 - 1) * inv2 + t2 * (t2 - 1) * inv2;
        sz += s;
    }
    return sz;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    to.resize(n);
    rep(i, n - 1) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        to[u].push_back(v);
        to[v].push_back(u);
    }
    dfs(0);
    ans /= mint(n - 1) * n * (n - 1) * inv2;
    cout << ans.val() << '\n';
}