#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

vector<vector<int>> E;
int N;
mint ans = 0;
vector<int> sz;
void dfs(int cur,int p){
	sz[cur] = 1;
	rep(i,E[cur].size()){
		int to = E[cur][i];
		if(to==p)continue;
		dfs(to,cur);
		sz[cur] += sz[to];
	}
	rep(i,E[cur].size()){
		int to = E[cur][i];
		if(to==p)continue;
		
		mint pp = sz[to];
		pp *= N-sz[to];
		pp /= N;
		pp /= N-1;
		pp *= 2;
		pp /= N-1;
		
		ans += pp;
		
	}
	
	
}

int main(){
	
	
	cin>>N;
	E.resize(N);
	
	rep(i,N-1){
		int u,v;
		cin>>u>>v;
		u--;v--;
		
		E[u].push_back(v);
		E[v].push_back(u);
	}
	sz.resize(N);
	dfs(0,-1);
	
	ans = 1-ans;
	
	cout<<ans.val()<<endl;
	
	
    return 0;
}