#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#define ll long long
#define mod 1000000007
using namespace std;

int n,m,a[25],h[300005],d[300005],bin[25];
int read(){
    int x=0; char ch=getchar();
    while (ch<'0' || ch>'9') ch=getchar();
    while (ch>='0' && ch<='9'){ x=x*10+ch-'0'; ch=getchar(); }
    return x;
}
int main(){
    int cas=read(),i;
    bin[0]=1; for (i=1; i<=17; i++) bin[i]=bin[i-1]<<1;
    while (cas--){
        n=read(); m=read();
        memset(d,-1,sizeof(d)); d[0]=0;
        for (i=1; i<=n; i++) scanf("%d",&a[i]);
        int head=0,tail=1; h[1]=0;
        while (head<tail){
            int x=h[++head];
            for (i=1; i<=n; i++){
                int y=x^a[i];
                if (d[y]==-1){ d[y]=d[x]+1; h[++tail]=y; }
            }
            for (i=0; i<17; i++){
                int y=x^bin[i];
                if (d[y]==-1){ d[y]=d[x]+1; h[++tail]=y; }
            }
        }
        ll ans=0;
        for (i=1; i<=m; i++){
            int x=read(),y=read(); ans=(ans+(ll)i*d[x^y])%mod;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}