#include<stdio.h>
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdlib>
#define ll long long
#define   MOD 1000000007
using namespace std;
int t,n,m,x,y,dis;
int p[5],a[5],b[5];
int son[100005];
ll ans;
void dfs(int k,int pleas,int s,int prs)
{
    if(pleas>prs)
    {
        dis=min(dis,s+abs(k-y));
        return;
    }
    for(int i=1; i<=3; i++)
        if(p[i]==0)
        {
            p[i]=1;
            dfs(b[i],pleas+1,s+abs(k-a[i])+1,prs);
            dfs(a[i],pleas+1,s+abs(k-b[i])+1,prs);
            p[i]=0;
        }
}
void work()
{
    scanf("%d%d",&n,&m);
    for(int i=1; i<=3; i++) scanf("%d%d",&a[i],&b[i]);
    ans=0;
    for(int i=1; i<=m; i++)
    {
        scanf("%d%d",&x,&y);
        dis=abs(x-y);
        for(int j=1; j<=3; j++) dfs(x,1,0,j);
        ans=(ans+((ll)(i)*(ll)(dis))%MOD)%MOD;
    }
    printf("%I64d\n",ans);
}
int main()
{
    scanf("%d",&t);
    while(t--)
        work();
    return 0;
}