#include<cstdio>
#include<algorithm>
using namespace std;

int T,n,a[1100],s;

int main()
{
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		for(int i=0;i<n;i++)    scanf("%d",&a[i]);
		s=0;
		while(n>1)
		{
			int m = 2;//氣泡排序，每次只排最小的兩個 
			while (m--)
			{           
				for (int j = 0; j<n; j++)
				{
					if (a[j]<a[j + 1])
					{
						int k = a[j];
						a[j] = a[j + 1];
						a[j + 1] = k;
					}
				}
			}
			a[n - 2] = a[n - 1] + a[n - 2];
			s = s + a[n - 2];
			n--;
		}
		printf("%d\n",s); 
	}
	return 0;
}