/* ***********************************************
Author        :
Created Time  :2016/2/28 星期日 16:13:18
File Name     :A.cpp
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;

#define ll long long
#define pi acos(-1.0)
#define maxn 200100
#define mod 1000000007
#define INF 99999999

struct Edge{
    int v;
    int l;
    int pre;
}edge[maxn];
int head[10];
int cnt;
bool vis[10];
int dis[10];
int a[10];

void addedge(int u,int v,int l){
    edge[cnt].v=v;
    edge[cnt].l=l;
    edge[cnt].pre=head[u];
    head[u]=cnt++;

    edge[cnt].v=u;
    edge[cnt].l=l;
    edge[cnt].pre=head[v];
    head[v]=cnt++;
}

void Dijkstra(){
    int n=8;
    memset(vis,0,sizeof(vis));
    for (int i=1;i<=n;i++) dis[i]=INF;
    for (int i=head[1];i!=-1;i=edge[i].pre) dis[edge[i].v]=min(edge[i].l,dis[edge[i].v]);
    vis[1]=1;dis[1]=0;
    for (int i=1;i<n;i++){
    //    printf("dis[4]=%d\n",dis[2]);
        int pos,min=INF;
        for (int j=1;j<=n;j++){
            if (!vis[j] && dis[j]<min){
                min=dis[j];
                pos=j;
            }
        }//printf("pos=%d\n",pos);
        vis[pos]=1;
        for (int j=head[pos];j!=-1;j=edge[j].pre){
            int v=edge[j].v,l=edge[j].l;
            if (!vis[v] && dis[pos]+l<dis[v]){
                dis[v]=dis[pos]+l;
            }
        }
    }
}

int solve(){
    cnt=0;
    memset(head,-1,sizeof(head));
    for (int i=1;i<=8;i++){
        for (int j=i+1;j<=8;j++){
            addedge(i,j,abs(a[i]-a[j]));
        }
    }
    for (int i=3;i<=8;i+=2){
        addedge(i,i+1,1);
    }
    Dijkstra();
    return dis[2];
}


int main(){
    int t,n,m;
    scanf("%d",&t);
    while (t--){
        scanf("%d%d",&n,&m);
        for (int i=3;i<=8;i++){
            scanf("%d",&a[i]);
        }
        ll ans=0;
        for (int i=1;i<=m;i++){
            scanf("%d%d",&a[1],&a[2]);
            ans=(ans+(ll)i*solve())%mod;
        }
        printf("%lld\n",ans);
    }
    return 0;
}