#include<iostream>
#include<stdio.h>
#include<algorithm>
#define rep(i,j,k) for(int i=j;i<=k;i++)
using namespace std;
int container[1010];
int main(){
	int t;scanf("%d",&t);
	rep(i,1,t){
		int n;scanf("%d",&n);
		rep(j,1,n){scanf("%d",&container[j]);}
		
		sort(container+1,container+n+1);
		
		int last=n;int ans=0;
		while(last){
			if(last==1){
				ans+=container[1];break;
			}else if(last==2){
				ans+=container[2];break;
			}else if(last==3){
				ans+=container[1]+container[2]+container[3];break;
			}
			int nop1=container[2]+container[1]+container[last]+container[2];
			int nop2=container[last-1]+container[1]+container[last]+container[1];
			ans+=min(nop1,nop2);
			last-=2;
		}
		printf("%d\n",ans);
	} 
	return 0;
}