#include <iostream>
#include <vector>
using namespace std;
const long long MOD = 1000000007;
void solve(){
  int n;cin>>n;
  vector<long long> A(n);
  for(int i = 0; n > i; i++){
    cin>>A[i];
  }
  vector<vector<pair<long long,long long>>> dp(n+1,vector<pair<long long,long long>>(2));
  dp[0][0] = {1,1};
  for(int i = 1; n >= i; i++){
    dp[i][0] = {(dp[i-1][0].first+dp[i-1][1].first)%MOD,(dp[i-1][0].second+dp[i-1][1].second)%MOD};
    dp[i][1] = {(dp[i-1][0].first+dp[i-1][1].first)%MOD,((dp[i-1][0].second+dp[i-1][1].second)*A[i-1])%MOD};
  }
  cout << (dp[n][0].second+dp[n][1].second-1+MOD)%MOD << endl;
  

}
int main(){
  int t;cin>>t;
  for(int i = 0; t > i; i++)solve();
}