#include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
using graph = vector<vector<P>>;
constexpr ll MOD = 998244353;
graph G;

ll modpow(ll a, ll x){
    ll ans = 1;
    while(x > 0){
        if(x & 1){
            ans *= a;
            ans %= MOD;
        }
        a *= a;
        a %= MOD;
        x >>= 1;
    }
    return ans;
}

ll mygcd(ll a, ll b){
    while(b != 0){
        ll r = a%b;
        a = b;
        b = r;
    }
    return a;
}

int dfs1(int cur, int parent){
    int ans = 1;
    for(auto &p: G[cur]){
        if(p.first == parent) continue;
        else{
            p.second = dfs1(p.first, cur);
            ans += p.second;
        }
    }
    return ans;
}

int main(){
    int n;
    cin >> n;
    G = graph(n);
    for(int i = 0; i < n-1; i++){
        int u, v;
        cin >> u >> v;
        u--; v--;
        G[u].push_back(make_pair(v, -1));
        G[v].push_back(make_pair(u, -1));
    }
    dfs1(0, -1);

    ll cnt1 = 0;
    for(auto &p: G){
        for(auto &pp: p){
            if(pp.second == -1) continue;
            cnt1 += (ll)pp.second*(pp.second-1);
            cnt1 += (ll)(n-pp.second)*(n-pp.second-1);
        }
    }
    //cerr << cnt1 << " " << n*(n-1)*(n-1) << endl;
    ll g = mygcd(cnt1, n*(n-1)*(n-1));

    ll ans = (cnt1/g)%MOD;
    ans *= modpow(((n*(n-1)*(n-1))/g)%MOD, MOD-2);
    cout << ans%MOD << endl;
    return 0;
}