#include<bits/stdc++.h>
#define debug(x) cerr<<#x<<" = "<<x
#define sp <<"  "
#define el <<endl
#define fgx cerr<<"-----------------------------------"<<endl
#define LL long long
#define uint unsigned int
#define unsigned long long
#define DB double
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
using namespace std;
inline LL read(){
    LL nm=0; bool fh=1; char cw=getchar();
    for(;!isdigit(cw);cw=getchar()) fh^=(cw=='-');
    for(;isdigit(cw);cw=getchar()) nm=nm*10+(cw-'0');
    return fh?nm:-nm;
}
#define mod 1000000007
namespace CALC{
    inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
    inline int mns(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
    inline int mul(LL x,LL y){return x*y%mod;}
    inline void upd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
    inline void dec(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
    inline int qpow(int x,int sq){LL res=1;for(;sq;sq>>=1,x=mul(x,x))if(sq&1)res=mul(res,x);return res;}
}using namespace CALC;

#define M 100020
int n,iv[M],a[M];
inline int solve(){
    n=read();for(int i=1;i<=n;i++) a[i]=(read()>>1); reverse(a+1,a+n+1); int ans=a[n];
    for(int i=1;i<n;i++) upd(ans,mul(mul(a[i],iv[2]),mul(mns(iv[a[i+1]],iv[a[i]]),a[i+1])));
    return ans;
}
int main(){
    iv[1]=1;
    for(int i=2;i<M;i++) iv[i]=mul(mod-mod/i,iv[mod%i]);
    for(int Cas=read();Cas;--Cas) printf("%d\n",solve());
    return 0;
}