def solve():
    n = int(input())
    e = []
    es = set()
    for i in range(n - 1):
        u, v = map(int, input().split())
        e.append((u, v))
        es.add((u, v))
        es.add((v, u))
    
    ans = 0
    for i in range(n-1):
        for j in range(i, n-1):
            if len(set([*e[i], *e[j]])) != 4:
                continue
            for f in range(2):
                for g in range(2):
                    if (e[i][f], e[j][g]) in es:
                        ans += 1
    
    print(ans)

t = int(input())
for i in range(t):
    solve()