#include <cstdio>
#include <algorithm>
using namespace std;

const int N = 100005;
const int M = 1000000007;

int a[N], h[N], p[N], sum[N], e[N], cnt[N];

void solve()
{
    int n;
    scanf("%d", &n);
    for (int i=0; i<n; ++i) {
        scanf("%d", &a[i]);
        h[i] = a[i];
    }
    sort(h, h+n);
    int m=unique(h, h+n)-h;
    for (int i=0; i<n; ++i) {
        a[i] = lower_bound(h, h+m, a[i])-h;
    }
    memset(cnt, 0, sizeof(cnt));
    int x=a[0];
    p[0] = sum[0] = h[x];
    cnt[x] += e[0];
    for (int i=1; i<n; ++i) {
        x = a[i];
        p[i] = (sum[i-1] + 1ll*e[i]*h[x]%M) % M;
        p[i] = ((p[i]-(1ll*cnt[x]*h[x]%M) % M) + M) % M;
        sum[i] = (sum[i-1]+p[i]) % M;
        cnt[x] = (cnt[x]+e[i]) % M;
    }
    printf("%d\n", sum[n-1]);
}

int main()
{
    e[0] = 1;
    for (int i=1; i<N; ++i) {
        e[i] = e[i-1]*2%M;
    }
    int n;
    scanf("%d", &n);
    for (int i=0; i<n; ++i) {
        solve();
    }
    return 0;
}