#include<bits/stdc++.h>
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') f=(ch=='-')?-1:1,ch=getchar();
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return x*f;
}
const int N=2000005;
int a[N],fa[N];
long long ans;
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
int main()
{
//	freopen("wifi.in","r",stdin);
//	freopen("wifi.out","w",stdout);
	int t=read();
	while(t--)
	{
		int n=read();a[1]=read(),fa[1]=1,ans=1ll*a[1]*(n-1);
		for(int i=2;i<=n;i++)
		{
			a[i]=read();int f=find(i-1);
			long long s=1ll*(n-f)*a[i]-1ll*(n-i)*a[f];
	//		cout<<s<<' '<<f<<endl;
			if(s>0)
			{
				ans+=s;int ff=find(f-1);
	//			cout<<ans<<endl;
				while(ff)
				{
					s=1ll*(f-ff)*(a[i]-a[f])+1ll*(i-f)*(a[ff]-a[f]);
					if(s<=0) break;
	//				cout<<i<<' '<<f<<' '<<ff<<' '<<s<<' ';
					ans+=s,fa[f]=ff,f=ff,ff=find(f-1);
	//				cout<<ans<<endl;
				}
				fa[i]=i;
			}
			else fa[i]=i-1;
		}
		printf("%lld\n",ans);
	}
	return 0;
}