// Pratiyush Mishra

#include <bits/stdc++.h>
#define ull unsigned long long int
#define ll long long int
#define LL_MAX 9223372036854775807
#define pb push_back
#define pf push_front
#define mp make_pair
#define popb pop_back
#define vl vector<ll>
#define bs(v, x) binary_search(v.begin(), v.end(), x)
#define mem1(a) memset(a, -1, sizeof(a))
#define popf pop_front
#define p() cout << '\n'
#define p0(x) cout << x << " "
#define p1(x) cout << x << '\n'
#define p2(x, y) cout << x << " " << y << '\n'
#define p3(x, y, z) cout << x << " " << y << " " << z << '\n'
#define printv(v)                   \
  for (ll i = 0; i < v.size(); ++i) \
    cout << v[i] << " ";            \
  cout << '\n'
#define pr1(x) cout << fixed << setprecision(15) << x << '\n'
#define ordered_set tree<pair<ll, ll>, null_type, less<pair<ll, ll>>, rb_tree_tag, tree_order_statistics_node_update>
// ordered_set s ; s.order_of_key(val)  no. of elements strictly less than val
// s.find_by_order(i)  itertor to ith element (0 indexed)
#define mod 1000000007
#define mod1 998244353
#define fio                         \
  ios_base::sync_with_stdio(false); \
  cin.tie(NULL)
#define get(n) \
  ll n;        \
  cin >> n
#define getvec(v, n)         \
  vector<ll> v(n);           \
  for (ll i = 0; i < n; i++) \
    cin >> v[i];
#define getstr(s) \
  string s;       \
  cin >> s
#define all(x) x.begin(), x.end()
#define countBits(x) __builtin_popcount(x)
using namespace std;

ll nC2(ll n)
{
  return ((n - 1) * n) / 2;
}

void mainSolve()
{
  get(n);
  vector<set<ll>> adj(n + 1);
  vl deg(n + 1, 0), cnt(n + 1, 1);
  cnt[0] = 0;
  for (int i = 0; i < n; i++)
  {
    get(a);
    get(b);
    adj[a].insert(b);
    adj[b].insert(a);
    deg[a]++;
    deg[b]++;
  }
  queue<ll> q;
  for (int i = 1; i <= n; i++)
  {
    if (deg[i] == 1)
      q.push(i);
  }
  while (!q.empty())
  {
    ll curr = q.front();
    q.pop();
    ll x = (*adj[curr].begin());
    cnt[x] += cnt[curr];
    adj[x].erase(curr);
    adj[curr].erase(x);
    cnt[curr] = 0;
    deg[x]--;
    if (deg[x] == 1)
      q.push(x);
  }
  ll ans = 0;
  //printv(cnt);
  for (int i = 1; i <= n; i++)
  {
    ans += (cnt[i] * (n - cnt[i]));
    ans += nC2(cnt[i]);
  }
  p1(ans);
}

int main()
{
  fio;
#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
  get(t);
  //ll t = 1;
  while (t--)
  {
    mainSolve();
  }
  return 0;
}
