#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"YES\n"; else cout<<"NO\n";}

ll jyo(ll x,ll y,ll z){
  ll H=y; //ここから
       ll a=1,b=x,c=1;
       while(H>0){
         a*=2;
         if(H%a!=0){
           H-=a/2;
           c*=b;
           c%=z;
         }
        b*=b;
         b%=z;
      } //ここまで
 return c;
}



void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll N;
	cin>>N;
	vector<vector<int>> G(N);
	rep(i,N-1){
		int a,b;
		cin>>a>>b;
		a--,b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	vector<ll> order={0},seen(N,-1),dp(N);
	seen[0]=-2;
	rep(i,N){
		int a=order[i];
		for(auto x:G[a]){
			if(seen[x]==-1){
				seen[x]=a;
				order.push_back(x);
			}
		}
	}
	ll ans=(N*(N-1)*(N-1))/2;
	rep(i,N){
		int a=order[N-i-1];
		dp[a]++;
		//cout<<dp[a]<<" "<<seen[a]<<" "<<a<<endl;
		if(a!=0){
			dp[seen[a]]+=dp[a];
			ans-=dp[a]*(N-dp[a]);
		}
	}
	ans%=mod;
	ans*=jyo((N*(N-1)*(N-1)/2)%mod,mod-2,mod);
	cout<<(ans%mod+mod)%mod<<"\n";
}