#include<iostream>
#include<string>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<iomanip>
using namespace std;
#define LL long long
const int N = 1e6+10;
const int INF = 0x3f3f3f3f;
int n,a[N],dp[N],dp2[N]; 
int main(){
	//freopen("","r",stdin);
	//freopen("","w",stdout);
	int T;
	cin>>T;
	while(T--){
		cin>>n;
		for(int i=1;i<=n;i++)cin>>a[i];
		for(int i=1;i<=n;i++){
			dp[i]=dp2[i-1]+a[i];
			dp2[i]=max(dp[i-1],dp2[i-1]);
		}
		cout<<max(dp[n],dp2[n])<<endl;
	}
	
	return 0;
}