#include<bits/stdc++.h>
#define l(p) t[p].ls
#define r(p) t[p].rs
#define v(p) t[p].val
using namespace std;
const int N=2.5e5+5,P=1e9+7,inf=0x3f3f3f3f;
using ull = unsigned int;
using ll = long long;
int n,m;
ll ans[N];
//选出两条树边
struct Node{
    int ls,rs;
    ull val;
}t[N*80*2];
int rt[N],tot;
ull pw[N];
mt19937 rd(time(0));
void change(int &p,int q,int l,int r,int k){
    p=++tot;t[p]=t[q];v(p)^=pw[k-1];
    if(l==r)return;
    int mid=l+r>>1;
    if(k<=mid)change(l(p),l(q),l,mid,k);
    else change(r(p),r(q),mid+1,r,k);
}
int query(int p,int q,int l,int r){
    if(l==r)return l;
    int mid=l+r>>1;
    if(v(l(p))==v(l(q)))return query(r(p),r(q),mid+1,r);
    return query(l(p),l(q),l,mid);
}
int LCP(int x,int y){
    int ans=query(rt[x],rt[y],0,m+1);
    // printf("%d %d %d\n",x,y,ans);
    return ans-1;
}
struct OP{
    int l,r;
}q[N];
bool cmp(int x,int y){
    int lcp=LCP(x,y);
    if(lcp==m)return 0;
    return q[lcp+1].l<=y&&y<=q[lcp+1].r;
}
//选出一条树边和一条非树边
int minn[N<<2][2],cnt[N<<2][2],tag[N<<2];
void pushup(int p){
    int mn=min(minn[p<<1][0],minn[p<<1|1][0]),se=inf;
    for(int i=0;i<2;i++)for(int j=0;j<2;j++)
        if(minn[p<<1|i][j]!=mn)se=min(se,minn[p<<1|i][j]);
    minn[p][0]=mn;minn[p][1]=se;
    cnt[p][0]=cnt[p][1]=0;
    for(int i=0;i<2;i++)for(int j=0;j<2;j++){
        if(minn[p<<1|i][j]==mn)cnt[p][0]+=cnt[p<<1|i][j];
        if(minn[p<<1|i][j]==se)cnt[p][1]+=cnt[p<<1|i][j];
    }
}
void upd(int p,int v){
    tag[p]+=v;
    minn[p][0]+=v;
    minn[p][1]+=v;
}
void pushdown(int p){
    if(tag[p]){
        upd(p<<1,tag[p]);
        upd(p<<1|1,tag[p]);
        tag[p]=0;
    }
}
void build(int p,int l,int r){
    tag[p]=0;
    if(l==r){
        minn[p][0]=0;minn[p][1]=inf;
        cnt[p][0]=1;cnt[p][1]=0;
        return;
    }int mid=l+r>>1;
    build(p<<1,l,mid);
    build(p<<1|1,mid+1,r);
    pushup(p);
}
void add(int p,int l,int r,int l1,int r1){
    if(l1>r1)return;
    if(l1<=l&&r<=r1){
        upd(p,1);
        return;
    }int mid=l+r>>1;pushdown(p);
    if(l1<=mid)add(p<<1,l,mid,l1,r1);
    if(r1>mid)add(p<<1|1,mid+1,r,l1,r1);
    pushup(p);
}
ll query(int i){//i为非树边的数量
    ll cnt0=0,cnt1=0;
    if(minn[1][0]==0)cnt0+=cnt[1][0];
    if(minn[1][0]==1)cnt1+=cnt[1][0];
    if(minn[1][1]==1)cnt1+=cnt[1][1];
    // assert(cnt0+cnt1<=n);
    return cnt0*(n-cnt0+i)+cnt1;
}
int id[N];
struct DSU{
    int fa[N],siz[N];
    ull ans;
    void init(int n){
        for(int i=1;i<=n;i++)fa[i]=i,siz[i]=1;
        ans=0;
    }
    int find(int x){
        return fa[x]==x?x:fa[x]=find(fa[x]);
    }
    void merge(int x,int y){
        x=find(x);y=find(y);
        if(x==y)return;
        if(siz[x]<siz[y])swap(x,y);
        ans-=1ll*siz[x]*(siz[x]-1)/2;ans-=1ll*siz[y]*(siz[y]-1)/2;
        fa[y]=x;siz[x]+=siz[y];
        ans+=1ll*siz[x]*(siz[x]-1)/2;
    }
}dsu;
struct op{
    int pos,val;
}p[N];
bool operator<(op x,op y){
    return x.val>y.val;
}
vector<int>vec[N];
bool FLAG;
int solve(){
    // memset(t,0,sizeof(t));
    scanf("%d%d",&n,&m);tot=0;n--;
    for(int i=1;i<=n;i++)id[i]=i,vec[i].clear();
    for(int i=1;i<=m;i++){
        scanf("%d%d",&q[i].l,&q[i].r);
        if(q[i].l>q[i].r)swap(q[i].l,q[i].r);
        q[i].r--;
        vec[q[i].l].push_back(i);
        vec[q[i].r+1].push_back(i);
    }
    if(!n){
        for(int i=1;i<=m;i++)printf("0\n");
        return 0;
    }
    for(int i=1;i<=n;i++){
        rt[i]=rt[i-1];
        for(auto&x:vec[i])change(rt[i],rt[i],0,m+1,x);
    }
    build(1,1,n);dsu.init(n);
    // if(FLAG){
    sort(id+1,id+n+1,cmp);
    // printf("ID:");for(int i=1;i<=n;i++)printf(" %d",id[i]);puts("");

    for(int i=1;i<=m;i++){
        add(1,1,n,q[i].l,q[i].r);
        ans[i]=query(i);
    }
    for(int i=1;i<n;i++)p[i].pos=i,p[i].val=LCP(id[i],id[i+1]);
    sort(p+1,p+n);
    for(int i=m,cur=1;i>=1;i--){
        while(cur<n&&p[cur].val==i){
            dsu.merge(p[cur].pos,p[cur].pos+1);
            cur++;
            // printf("DSU:%d\n",i);
        }
        ans[i]+=dsu.ans;
    }
    for(int i=1;i<=m;i++)printf("%lld\n",ans[i]);
    // }
    // if(clock()>(double)CLOCKS_PER_SEC*0.8)exit(0);
    return 0;
}
int main(){
    pw[0]=1;
    for(int i=1;i<=N-5;i++)pw[i]=rd();
    int t;scanf("%d",&t);if(t!=2507)FLAG=1;
    while(t--)solve();
    return 0;
}