#include using namespace std; #define F first #define S second #define R cin>> #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) ll check(ll n,ll m,ll x,ll y){return x>=0&&x=0&&yvoid pr(const A &a,const B&...b){cout<void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")< P; int n; vector

v[100001]; int solve(int i,int p) { if(v[i].size()==1&&v[i][0].F==p) { v[i][0].S=n-1; return 1; } int q=0,k=-1; for(int j=0; j0){q=r0/r1;r2=r0%r1;a2=a0-q*a1;b2=b0-q*b1;r0=r1;r1=r2;a0=a1;a1=a2;b0=b1;b1=b2;} *c=r0;*a=a0;*b=b0; } ll get_inv(ll n, ll p){ ll a,b,c; extended_euclid(n,p,&c,&a,&b); if(a> n; rep(i,n-1) { ll x,y; cin >> x >> y; x--,y--; v[x].pb(P(y,-1)); v[y].pb(P(x,-1)); } solve(0,-1); ll ans=0; ll sum=n*(n-1)%MAX*(n-1)%MAX*get_inv(2,MAX)%MAX; rep(i,n) { rep(j,v[i].size()) { ll c=v[i][j].S; ll d=n-c; ans+=c*d; ans%=MAX; } } ans*=get_inv(2,MAX); ans%=MAX; ans=(sum-ans+MAX)%MAX; pr(ans*get_inv(sum,MAX)%MAX); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}