#include <bits/stdc++.h>
#include <atcoder/all>

#define rep(i, n) for(int i = 0; i < (int)(n); i++)

using mint = atcoder::modint998244353;

mint dp[100010];

std::vector<int> G[100010];
bool seen[100010];

int dfs(int node = 0) {
    for(const auto &to:G[node]) {
        if(seen[to]) continue;
        seen[to] = true;
        dp[node] += dfs(to);
    }
    return (++dp[node]).val();
}

int main() {
    long long n;
    std::cin >> n;
    std::vector<std::pair<long long, long long>> v(n-1);
    rep(i, n-1) {
        int a, b;
        std::cin >> a >> b;
        a--, b--;
        v[i] = {a, b};
        G[a].push_back(b);
        G[b].push_back(a);
    }
    seen[0] = true;
    dfs();
    //rep(i, n) std::cout << dp[i].val() << ' ';std::endl(std::cout);
    mint ans = 0;
    for(auto [a, b]:v) {
        if(dp[a].val()<dp[b].val()) std::swap(a, b);
        ans += (n-dp[b])*dp[b];
        //std::cout << (dp[a]-dp[b]).val() << ' ' << dp[b].val() << std::endl;
    }
    //rep(i, n) ans += dp[i]*(n-dp[i]);
    //std::cout << ans.val() << std::endl;
    ans/=(n-1)*n*(n-1)/2;
    ans = 1-ans;
    std::cout << ans.val() << std::endl;
    return 0;
}