#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

int n,m;
int d[10000];

int main(){
    int Tc,i,x,y;
    scanf("%d",&Tc);
    while (Tc--){
      scanf("%d%d",&n,&m);
      memset(d,0,sizeof(int)*n);
      for (i=0;i<m;i++){
          scanf("%d%d",&x,&y);
          d[--x]++;
          d[--y]++;
      }
      long long ans=0;
      for (i=0;i<n;i++)
        ans+=(long long)(d[i])*(d[i]);
      printf("%lld\n",ans);
      if (Tc) puts("");
    }
    return 0;
}