#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=2e18;

ll n;
ll x=0, y=0;
VVI g(200000);

int dfs(int v, int p){
    int sum=1;
    for(auto to:g[v]){
        if(to!=p){
            ll r=dfs(to,v);
            x-=r*(n-r)*2;
            sum+=r;
        }
    }
    return sum;
}

ll power(ll x, ll y){
    x%=MOD;
    ll ret=1;
    while(y){
        if(y&1) ret=ret*x%MOD;
        x=x*x%MOD;
        y>>=1;
    }
    return ret;
}

int main(){
    cin >> n;
    int a, b;
    REP(i,n-1){
        cin >> a >> b;
        a--, b--;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    y=n*(n-1)*(n-1);
    x=y;
    dfs(0,-1);
    x%=MOD;
    cout << x*power(y,MOD-2)%MOD << endl;
}