#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007LL

ll inv[2010];
int num[1010],t,n;

inline int rd()
{
    int x=0;char ch=getchar();
    for (;ch<'0'||ch>'9';ch=getchar());
    for (;ch>='0'&&ch<='9';ch=getchar()) x=x*10+ch-'0';
    return x;
}

inline ll pls(const ll &x,const ll &y) { return (x+y<mod)?x+y:x+y-mod; }
inline ll mns(const ll &x,const ll &y) { return (x-y<0)?x-y+mod:x-y; }
inline ll ksm(ll x,ll y) { ll res=1;for (;y;y>>=1,x=x*x%mod) if (y&1) res=res*x%mod;return res; }

inline void pre_gao()
{
    inv[1]=1;
    for (int i=2;i<=2000;i++) inv[i]=(mod-mod/i)*inv[mod%i]%mod;
}

inline void work()
{
    n=rd();
    for (int i=1;i<=n;i++) num[i]=rd()/2;
    ll ans=0;
    for (int i=1;i<=n;i++) ans+=num[i];
    for (int i=1;i<n;i++)
    {
        int h1=num[i+1],h2=num[i];
        int hh=h1/(h2*2),hhh=h1-h2*2*hh;
        if (hhh<h2) ans=mns(ans,pls(hh*(h2-hhh)%mod,(hh+1)*(h2+hhh)%mod)*inv[h2*2]%mod*num[i]%mod);
        else hhh-=h2,ans=mns(ans,pls((hh+2)*hhh%mod,(hh+1)*(h2*2-hhh)%mod)*inv[h2*2]%mod*num[i]%mod);
    }
    printf("%lld\n",ans);
}

int main()
{
    t=rd();pre_gao();
    while (t--) work();
    return 0;
}