#include <bits/stdc++.h>
using namespace std;
const int MAXN=1010;
const int MOD=1e9+7;
int POW(int x,int k)
{
    int ans=1;
    for (;k;k>>=1,x=1LL*x*x%MOD) if (k&1) ans=1LL*ans*x%MOD;
    return ans;
}
int N,inv[MAXN],A[MAXN];
void Solve()
{
    long long Ans=0;
    cin>>N;
    for (int i=1;i<=N;++i) cin>>A[i],Ans+=A[i]/2;
    for (int i=2;i<=N;++i)
    {
        long long v=1LL*(A[i]/2)*(A[i-1]/2)%MOD*(inv[A[i]]+inv[A[i-1]])%MOD;
        Ans-=v;
    }
    Ans%=MOD;
    if (Ans<0) Ans+=MOD;
    cout<<Ans<<endl;
}
int main()
{
    for (int i=1;i<=1000;++i) inv[i]=POW(i,MOD-2);
    int TT;
    cin>>TT;
    for (int i=1;i<=TT;++i) Solve();
    return 0;
}