#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

bool is_kadomatsu(long long a,long long b,long long c){
	if(a==b||b==c||c==a)return false;
	if(b>a&&b>c)return true;
	if(b<a&&b<c)return true;
	return false;
}

long long get(vector<long long> A){
	vector<long long> dp(A.size()+1,0LL);
	rep(i,A.size()){
		dp[i+1] = max(dp[i+1],dp[i]);
		if(i+3<dp.size()){
			if(is_kadomatsu(A[i],A[i+1],A[i+2])){
				dp[i+3] = max(dp[i+3],dp[i] + A[i]);
			}
		}
	}
	return dp.back();
}

int main(){
	
	int T;
	cin>>T;
	
	rep(_,T){
		int N;
		scanf("%d",&N);
		
		vector<long long> A(N);
		rep(i,N){
			scanf("%lld",&A[i]);
		}
		long long ans = 0LL;
		rep(i,3){
			ans = max(ans,get(A));
			long long t = A.back();
			A.pop_back();
			A.insert(A.begin(),t);
		}
		printf("%lld\n",ans);
	}
		
	
    return 0;
}