#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn=1e5+10;
const LL mod=1e9+7;
LL dp[maxn],num,sum[maxn];
map<int,LL>mp;
int n,a[maxn];
int main()
{   
    int t;
    scanf("%d",&t);
    while(t--)
    {
        mp.clear();
        scanf("%d",&n);
        for(int i=1;i<=n;i++)scanf("%d",&a[i]);
        sum[1]=a[1];num=1;mp[a[1]]=1;
        for(int i=2;i<=n;i++)
        {
            dp[i]=(a[i]+sum[i-1])%mod;
            dp[i]=(dp[i]+(num-mp[a[i]]+mod)%mod*a[i])%mod;
            mp[a[i]]=(mp[a[i]]+num+1)%mod;
            num=(num*2+1)%mod;
            sum[i]=(sum[i-1]+dp[i])%mod;
        }
        printf("%lld\n",sum[n]);
    }
    return 0;
}