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

using ll = long long;

bool chmin(auto &a, auto b) { return a > b ? a = b, true : false; }
bool chmax(auto &a, auto b) { return a < b ? a = b, true : false; }

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    vector<vector<int>> G(N);
    for (int i = 1, u, v; i < N; i++) {
        cin >> u >> v;
        u--, v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    vector<int> sub(N);
    mint ans = 0;
    auto dfs = [&] (auto dfs, int u, int p) -> void {
        for (auto v : G[u]) {
            if (v == p) continue;
            dfs(dfs, v, u);
            sub[u] += sub[v];
            ans += mint(sub[v]) * (N - sub[v]);
        }
        sub[u]++;
    };
    dfs(dfs, 0, -1);
    ans /= mint(N) * (N - 1) * (N - 1) / 2;
    ans = 1 - ans;
    cout << ans.val() << endl;
}