#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MM(a,b) memset(a,b,sizeof(a));
const double eps = 1e-10;
const int  inf =0x7f7f7f7f;
const double pi=acos(-1);
const int maxn=100+100000;
int deg[maxn];

vector<int> G[maxn];
struct node{
    int id;
    bool operator<(const node &b) const
    {
        return this->id<b.id;
    }
}ne[maxn];

int main()
{
    int cas,n,m;
    scanf("%d",&cas);
    while(cas--)
    {
         scanf("%d %d",&n,&m);
         ll ans=0;
         for(int i=1;i<=n;i++)
         {
             G[i].clear();
             ne[i].id=i;
         }
         memset(deg,0,sizeof(deg));

         priority_queue<node> q;
         for(int i=1;i<=m;i++)
         {
             int u,v;
             scanf("%d %d",&u,&v);
             G[u].push_back(v);
             deg[v]++;
         }

         for(int i=1;i<=n;i++) if(!deg[i]) q.push(ne[i]);
         int minn=n+1;
         while(q.size())
         {
             node k=q.top();q.pop();
             int u=k.id;
             minn=min(minn,u);
             ans+=minn;
             for(int j=0;j<G[u].size();j++)
             {
                 int v=G[u][j];
                 deg[v]--;
                 if(!deg[v]) q.push(ne[v]);
             }
         }
         printf("%lld\n",ans);
    }
    return 0;
}