import java.io.*; import java.util.*; public class Main { static ArrayList> graph = new ArrayList<>(); static long ans = 0; static int n; static final int MOD = 998244353; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); n = sc.nextInt(); for (int i = 0; i < n; i++) { graph.add(new ArrayList<>()); } for (int i = 0; i < n - 1; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; graph.get(a).add(b); graph.get(b).add(a); } getCount(0, 0); System.out.println(ans * pow((n - 1) * getComb(n) % MOD, MOD - 2) % MOD); } static int getCount(int idx, int p) { int count = 1; for (int x : graph.get(idx)) { if (x == p) { continue; } int tmp = getCount(x, idx); ans += getComb(tmp); ans += getComb(n - tmp); ans %= MOD; count += tmp; } return count; } static long pow(long x, int p) { if (p == 0) { return 1; } else if (p % 2 == 0) { return pow(x * x % MOD, p / 2); } else { return pow(x, p - 1) * x % MOD; } } static long getComb(long x) { return x * (x - 1) / 2 % MOD; } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }