#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
    int T;
    scanf("%d", &T);
    for(int ii = 0; ii < T; ++ ii) {
        int n; int m;
        scanf("%d%d", &n, &m);
        const int K = 3;
        pii edges[K];
        vi vertices;
        rep(i, K) {
            int a; int b;
            scanf("%d%d", &a, &b), -- a, -- b;
            edges[i] = mp(a, b);
            vertices.push_back(a);
            vertices.push_back(b);
        }
        sort(vertices.begin(), vertices.end());
        vertices.erase(unique(vertices.begin(), vertices.end()), vertices.end());
        int V = vertices.size();
        vector<vi> dist(V, vi(V, INF));
        rep(i, V) rep(j, V) dist[i][j] = abs(vertices[i] - vertices[j]);
        rep(i, K) {
            int a = edges[i].first, b = edges[i].second;
            int u = lower_bound(vertices.begin(), vertices.end(), a) - vertices.begin();
            int v = lower_bound(vertices.begin(), vertices.end(), b) - vertices.begin();
            amin(dist[u][v], 1);
            amin(dist[v][u], 1);
        }
        rep(k, V) rep(i, V) rep(j, V)
            amin(dist[i][j], dist[i][k] + dist[k][j]);
        ll anssum = 0;
        rep(ii, m) {
            int s; int t;
            scanf("%d%d", &s, &t), -- s, -- t;
            int ans = abs(s - t);
            rep(i, V) rep(j, V)
                amin(ans, abs(s - vertices[i]) + dist[i][j] + abs(vertices[j] - t));
            anssum += (ll)ans * (ii + 1);
        }
        printf("%d\n", (int)(anssum % 1000000007));
    }
    return 0;
}