#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mod=1e9+7;
ll ans;
int n,a[1005];
inline void read(int &x)
{
    char c=getchar();
    x=0;
    while (c<'0'||c>'9')
        c=getchar();
    while (c>='0'&&c<='9')
    {
        x=x*10+c-'0';
        c=getchar();
    }
}
inline int ksm(int x,int y)
{
    int z=1;
    while (y)
    {
        if (y&1)
            z=(ll)z*x%mod;
        x=(ll)x*x%mod;
        y>>=1;
    }
    return z;
}
inline ll work(int x,int y)
{
    return (ll)(ksm(x,mod-2)+ksm(y,mod-2))%mod*x/2%mod*y/2%mod;
}
int main()
{
    int T;
    read(T);
    while (T--)
    {
        read(n);
        ans=0;
        for (int i=1;i<=n;++i)
        {
            read(a[i]);
            ans=ans+a[i]/2;
        }
        for (int i=1;i<n;++i)
            ans-=work(a[i],a[i+1]);
        ans=(ans%mod+mod)%mod;
        printf("%d\n",(int)ans);
    }
    return 0;
}