#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);
        vector<int> a(n);
        for(int i = 0; i < n; ++ i)
            scanf("%d", &a[i]);
        int B = 17;
        rep(i, B)
            a.push_back(1 << i);
        n += B;
        vector<int> dist(1 << B, INF);
        vi q;
        q.push_back(0);
        dist[0] = 0;
        for(int h = 0; h != q.size(); ++ h) {
            int x = q[h];
            rep(i, n) {
                int y = x ^ a[i];
                if(dist[y] == INF) {
                    dist[y] = dist[x] + 1;
                    q.push_back(y);
                }
            }
        }
        ll anssum = 0;
        rep(jj, m) {
            int s; int t;
            scanf("%d%d", &s, &t);
            int ans = dist[s ^ t];
            anssum += (ll)ans * (jj + 1);
        }
        printf("%d\n", (int)(anssum % 1000000007));
    }
    return 0;
}