D - ECPC

#include <bits/stdc++.h>

#define forn(l, r) for(int i = l; i < (r); ++i)
#define forj(l, r) for(int j = l; j < (r); ++j)
#define TAM 1000100
#define SYNC ios::sync_with_stdio(0);
#define $ << ' ' <<
#define F first
#define S second
#define endl '\n'


using namespace std;

using ll = long long int;
using ii = pair<int, int>;
using vii = vector<ii>;
using vi = vector<int>;
using graph = vector<vi>;
const int INF = 0x3f3f3f3f;
const int MAXN = 112345;
const ll mod = 1000000007;



int main() {
    //SYNC
    freopen("lcm.txt", "r+", stdin);
    int t, n, x = 1;
    scanf("%d", &t);
    while (t--) {
        ll ans = 0;
        ll aa[MAXN];
        scanf("%d", &n);
        forn (0, n) {
            scanf("%d", &aa[i]);
        }
        forn (0, n){
            forj (0, n) {
                if (!j) {
                    j = i;
                    ans += aa[i]%mod;
                } else {
                    ans += (2*((aa[i]*aa[j])/__gcd(aa[i], aa[j])))%mod;
                }
            }
        }
        printf("%lld\n", ans%mod);
    }



}