#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef unordered_map<int,int> umap;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define popcount __builtin_popcount
#define case cout<<"Case "<<__testcase-testcase<<": ";
#define endl '\n'

#define INF 1e18




int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int testcase=1;
    cin>>testcase;
    int __testcase=testcase;
    while(testcase--){
       int n;
       cin>>n;
       ll a[n];
       for(int i=0;i<n;i++) cin>>a[i];
       multiset<ll> ms;
       for(int i=0;i<n;i++) ms.insert(a[i]);
       ll ans=0;
       while(ms.size()){
        ll tp=*ms.begin();
        //ans+=tp;
        ms.erase(ms.find(tp));
        if(ms.size()){
            ll tp2=*ms.begin();
            ms.erase(ms.find(tp2));
            ans+=tp+tp2;
            ms.insert(tp+tp2);
        }

       }
       cout<<ans<<endl;
    }
}