#include <bits/stdc++.h>
using namespace std;

#define int long long

const long double PI = 3.14159265359;

const int MOD = 1e9 + 7;

int modpower(int base, int exponent)
{
    int res = 1;
    int b = base % MOD;
    while (exponent > 0)
    {
        if (exponent & 1 == 1)
        {
            res = (res * b) % MOD;
        }
        b = (b * b) % MOD;
        exponent >>= 1;
    }
    return res;
}

void solve()
{
    int n;
    cin >> n;
    vector<int> arr(n);
    map<int, int> freq;
    for (auto &val : arr)
    {
        cin >> val;
        freq[val]++;
    }

    vector<int> dist;
    int mx = 0;
    for (auto [val, cnt] : freq)
        if (cnt == 1)
            dist.push_back(val);
        else
            mx = max(mx, val);

    sort(dist.rbegin(), dist.rend());
    int ans = 1;
    for (int i = 0; i < dist.size(); i++)
    {
        if (dist[i] < mx)
            break;
        ans = (ans % MOD + modpower(dist[i] - 1, i + 1) % MOD) % MOD;
    }
    cout << ans % MOD << '\n';
}

signed main(void)
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen("input.txt", "r"))
    {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}