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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

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

int main() {
    int n; cin >> n;

    auto g = vec<int>(uns, n, 0);
    auto e = vec<tuple<int, int>>(uns, 0);
    for (int i = 1; i < n; ++i) {
        int u, v; cin >> u >> v; --u; --v;
        g[u].push_back(v);
        g[v].push_back(u);
        e.emplace_back(u, v);
    }

    // dp[i] = i を根とする部分木に含まれる頂点数
    map<tuple<int, int>, bool> t;
    auto dp = vec<int>(uns, n);

    auto dfs = [&](int v, int p, auto &&dfs) -> int {
        int sum = 0;
        for (auto u : g[v]) {
            if (u == p) continue;
            sum += dfs(u, v, dfs);
            t[{ v, u }] = true;
        }
        return dp[v] = sum + 1;
    };

    dfs(0, -1, dfs);

    mint ans = 0;
    for (auto [u, v] : e) {
        if (!t[{ u, v }]) {
            swap(u, v);
        }

        mint v1 = dp[v];
        mint v2 = dp[0] - dp[v];

        ans += v1 * (v1 - 1) / 2;
        ans += v2 * (v2 - 1) / 2;
    }

    mint div = 1;
    div *= n;
    div *= n - 1;
    div *= n - 1;
    div /= 2;

    cout << (ans / div).val() << endl;
}