def solve():
	N = int(input())
	G = [[] for i in range(N)]
	for i in range(N-1):
		u, v = map(int, input().split())
		u -= 1; v -= 1
		G[u].append(v)
		G[v].append(u)
	
	ans = 0
	for i in range(N):
		dist = [-1]*N
		dist[i] = 0
		Q = [i]
		while Q:
			v = Q.pop()
			for to in G[v]:
				if dist[to] == -1:
					dist[to] = dist[v] + 1
					Q.append(to)
		ans += dist.count(3)
	print(ans//2)
	
for _ in range(int(input())):
	solve()