#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
 
void solve() {
    int n;
    cin >> n;
    vector<ll> a(n);
    ll sum = 0, mx = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += a[i];
        mx = max(mx, a[i]);
    }
    if (n == 1) {
        cout << 0 << "\n";
    } else if (n == 2) {
        cout << max(a[0], a[1]) << "\n";
    } else {
        cout << sum - mx + mx * (n - 1) << "\n";
    }
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin >> t;
    while (t--) solve();
    return 0;
}

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKdHlwZWRlZiBsb25nIGxvbmcgbGw7Cgp2b2lkIHNvbHZlKCkgewogICAgaW50IG47CiAgICBjaW4gPj4gbjsKICAgIHZlY3RvcjxsbD4gYShuKTsKICAgIGxsIHN1bSA9IDAsIG14ID0gMDsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgY2luID4+IGFbaV07CiAgICAgICAgc3VtICs9IGFbaV07CiAgICAgICAgbXggPSBtYXgobXgsIGFbaV0pOwogICAgfQogICAgaWYgKG4gPT0gMSkgewogICAgICAgIGNvdXQgPDwgMCA8PCAiXG4iOwogICAgfSBlbHNlIGlmIChuID09IDIpIHsKICAgICAgICBjb3V0IDw8IG1heChhWzBdLCBhWzFdKSA8PCAiXG4iOwogICAgfSBlbHNlIHsKICAgICAgICBjb3V0IDw8IHN1bSAtIG14ICsgbXggKiAobiAtIDEpIDw8ICJcbiI7CiAgICB9Cn0KCmludCBtYWluKCkgewogICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKE5VTEwpOwogICAgaW50IHQ7CiAgICBjaW4gPj4gdDsKICAgIHdoaWxlICh0LS0pIHNvbHZlKCk7CiAgICByZXR1cm4gMDsKfQ==

Mwo0CjEgMSAzIDIKMgowIDIKNwoxIDEgNCA1IDEgNCAxCg==

3
4
1 1 3 2
2
0 2
7
1 1 4 5 1 4 1