#include <iostream>
#include <vector>

#include <atcoder/modint>

using mint = atcoder::modint998244353;

namespace atcoder {
    std::istream& operator>>(std::istream& in, mint &a) {
        long long e; in >> e; a = e;
        return in;
    }
    
    std::ostream& operator<<(std::ostream& out, const mint &a) {
        out << a.val();
        return out;
    }
} // namespace atcoder

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n;
    std::cin >> n;

    std::vector<std::vector<int>> g(n);
    for (int i = 0; i < n - 1; ++i) {
        int u, v;
        std::cin >> u >> v;
        --u, --v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    const mint m = n * (n + 1) / 2;

    mint ans = 0;
    auto dfs = [&](auto dfs, int u, int p) -> int {
        mint cnt = 0;

        int subu = 1;
        for (int v : g[u]) if (v != p) {
            int subv = dfs(dfs, v, u);
            ans -= mint(m - subv * (n - subv)).inv();
            cnt += subv * (subv + 1) / 2;
            subu += subv;
        }
        if (p != -1) {
            int subp = n - subu;
            cnt += subp * (subp + 1) / 2;
        }
        ans += cnt.inv();
        return subu;
    };
    dfs(dfs, 0, -1);
    
    std::cout << (m * ans).val() << std::endl;
}