#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 10, M = 2 * N;
int h[N], e[M], w[M], ne[M], idx;
int odd, even;
int n;
void add(int a, int b, int c) // 添加一条边a->b,边权为c
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++ ;
}
void dfs(int u, int fa, int dist)
{
if (dist & 1) even ++ ;
else odd ++ ;
for (int i = h[u]; ~i; i = ne[i])
{
int j = e[i];
if (j == fa) continue;
dfs(j, u, dist + 1);
}
}
signed main()
{
int t;
cin >> t;
while (t -- )
{
idx = 0;
memset(h, -1, sizeof h);
odd = even = 0;
cin >> n;
int a, b;
for (int i = 1; i < n; i ++ )
{
cin >> a >> b;
add(a, b, 1), add(b, a, 1);
}
dfs(1, 0, 0);
if (n & 1) cout << 2 * (odd * even * even + even * odd * odd) << endl;
else cout << (even * even + odd * odd) * n << endl;
}
return 0;
}