#pragma GCC optimize ("O2") #pragma GCC target ("avx") #include //#include //using namespace atcoder; using namespace std; typedef long long ll; #define rep(i, n) for(int i = 0; i < (n); i++) #define rep1(i, n) for(int i = 1; i <= (n); i++) #define co(x) cout << (x) << "\n" #define cosp(x) cout << (x) << " " #define ce(x) cerr << (x) << "\n" #define cesp(x) cerr << (x) << " " #define pb push_back #define mp make_pair #define chmin(x, y) x = min(x, y) #define chmax(x, y) x = max(x, y) #define Would #define you #define please const int mod = 998244353; constexpr ll modpow(ll A, ll B) { ll kotae = 1; while (B > 0) { if (B & 1) kotae = kotae * A % mod; A = A * A % mod; B >>= 1; } return kotae; } int N; vector E[100100]; ll kotae; int dfs(int u, int mae) { int ret = 1; for (int v : E[u]) if (v != mae) { ll tmp = dfs(v, u); kotae += tmp * (N - tmp) * 2; ret += tmp; } return ret; } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> N; rep(i, N - 1) { int u, v; cin >> u >> v; E[u].pb(v); E[v].pb(u); } dfs(1, -1); kotae = (ll(N - 1) * (N - 1) * N - kotae) % mod; co(kotae% mod* modpow(N, mod - 2) % mod* modpow(N - 1, mod - 2) % mod* modpow(N - 1, mod - 2) % mod); Would you please return 0; }