#include<iostream>
#include<vector>
#include<tuple>
using namespace std;
typedef long long ll;
typedef tuple<ll,ll,ll> tlll;
const ll MOD=998244353;
ll Euclid(ll a,ll b){
    if(a<b) swap(a,b);
    ll q=a/b;ll r=a-q*b;
    if(r==0) return b;
    return Euclid(b,r);
}
tlll check(ll a,ll b){
    if(a<b) swap(a,b);
    if(b==0) return make_tuple(a,1,0);
    ll q=a/b;ll r=a-q*b;
    auto sub=check(b,r);
    return make_tuple(get<0>(sub),get<2>(sub),get<1>(sub)-get<2>(sub)*q);
}
int main(){
    ll n;
    cin>>n;
    int u,v;
    vector<vector<int>> g(n+1);
    for(int i=1;i<=n-1;i++){
        cin>>u>>v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<ll> sz(n+1,1);
    vector<int> p(n+1,-2);
    vector<int> ngb(n+1,0);
    u=1;
    p[u]=-1;
    ll rst=0;
    while(true){
        if(ngb[u]<g[u].size()){
            v=g[u][ngb[u]++];
            if(p[v]!=-2) continue;
            p[v]=u;
            u=v;
        }else{
            if(p[u]==-1) break;
            v=p[u];
            sz[v]+=sz[u];
            rst+=sz[u]*(n-sz[u]);
            u=v;
        }
    }
    //1-2*rst/n*(n-1)^2
    ll d=Euclid(2*rst,n*(n-1)*(n-1));
    ll pfz=((n*(n-1)*(n-1)-2*rst)/d)%MOD;
    ll q=(n*(n-1)*(n-1)/d)%MOD;
    ll q_inv=get<2>(check(MOD,q));
    q_inv=(q_inv%MOD+MOD)%MOD;
    cout<<(q_inv*pfz)%MOD<<endl;
    return 0;
}