rt

#include<iostream>
#include<cmath>
#include<map>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;
int read(){
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
long long T,a[101];
int main(){
	T=read();
	for(int qwq=1;qwq<=T;qwq++){
		long long n=read(),sum=0,maxx=-0x7fffffff;
		for(int i=1;i<=n;i++){
			a[i]=read();
			sum+=a[i];
		}
		long long summ;
		for(int i=1;i<=n;i++){
			int maxxx=a[i];
			summ=a[i];
			for(int j=i+1;j<=n;j++){
				if(maxxx<=a[j]){
					maxxx=a[j];
					summ+=a[j];
				}
			}
			//cout <<summ<<endl;
			maxx=max(summ,maxx);
			//cout <<maxx<<"-"<<endl;
		}
		cout <<sum-maxx<<endl;
	}
	return 0;
}