#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=200010;
ll n;
ll ans=0;
//Combination
long long extGCD(long long a,long long mod,long long &x,long long &y){
    if(mod==0){
        x=1;
        y=0;
        return a;
    }
    long long d=extGCD(mod,a%mod,y,x);
    y-=(a/mod)*x;
    return d;
}
long long invmod(long long a,long long mod){
    long long x,y;
    extGCD(a,mod,x,y);
    x%=mod;
    if(x<0)x+=mod;
    return x;
}
ll fac[MAX],finv[MAX],inv[MAX];
void combinit(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    REP(i,2,MAX){
        fac[i]=fac[i-1]*i%mod;
        inv[i]=invmod(i,mod);
        finv[i]=finv[i-1]*inv[i]%mod;
    }
}
ll comb(ll n,ll k){
    if(n<k)return 0;
    if(n<0||k<0)return 0;
    return fac[n]*(finv[k]*finv[n-k]%mod)%mod;
}
ll dfs(ll u,ll p,vector<vector<ll> >&G){
    ll res=1;
    for(auto e:G[u]){
        if(e==p)continue;
        ll x=dfs(e,u,G);
        ans+=x*(x-1)/2+(n-x)*(n-x-1)/2;
        ans%=mod;
        res+=x;
    }
    return res;
}

signed main(){
    cin>>n;
    vector<vector<ll> >G(n);
    rep(i,n-1){
        ll u,v;cin>>u>>v;
        u--;v--;
        G[u].pb(v);
        G[v].pb(u);
    }
    ll st=0;
    rep(i,n){
        if(G[i].size()==1)st=i;
    }
    dfs(st,-1,G);
    ll b=n*(n-1)/2%mod*(n-1)%mod;
    ans=ans*invmod(b,mod)%mod;
    if(ans<0)ans+=mod;
    cout<<ans<<endl;
}