#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int m;
cin >> m;
while (m--)
{
int n;
cin >> n;
vector<long long> times(n);
for (int i = 0; i < n; i++) {
cin >> times[i];
}
sort(times.begin(), times.end());
long long sum = 0;
long long way1 = 0;
long long way2 = 0;
while (n > 3)
{
way1 = 2 * times[0] + times[n - 1] + times[n - 2];
way2 = times[0] + times[1] * 2 + times[n - 1];
if (way1 < way2)
sum += way1;
else
sum += way2;
n -= 2;
}
if (n == 1)
sum += times[0];
if (n == 2)
sum += times[1];
if (n == 3)
sum += times[0] + times[1] + times[2];
cout << sum << endl;
}
return 0;
}