using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Globalization;
using System.Runtime.CompilerServices;
using System.Runtime.Intrinsics.X86;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var t = NN;
        var ans = new long[t];
        for (var u = 0; u < t; ++u)
        {
            var n = NN;
            var map = NArr(n - 1);
            ans[u] = Compl(n, map);
        }
        WriteLine(string.Join("\n", ans));
    }
    static long Compl(int n, int[][] map)
    {
        var tree = new List<int>[n];
        for (var i = 0; i < n; ++i) tree[i] = new List<int>();
        foreach (var edge in map)
        {
            tree[edge[0] -1].Add(edge[1] - 1);
            tree[edge[1] - 1].Add(edge[0] - 1);
        }
        var ans = 0L;
        var mod = 998_244_353;
        for (var i = 0; i < n; ++i)
        {
            if (tree[i].Count > 1)
            {
                foreach (var next in tree[i])
                {
                    if (i > next) continue;
                    ans = (ans + (tree[i].Count - 1L) * (tree[next].Count - 1L) % mod) % mod;
                }
            }
        }
        return ans;
    }
}