#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}

bool kado(ll a,ll b,ll c){
	return a!=c&&(a-b)*(b-c)<0;
}

ll f(ll N,vector<ll> &A){
	vector<ll> dp(N+1);
	rep(i,N){
		if(i<N-2&&kado(A[i],A[i+1],A[i+2])){
			chmax(dp[i+3],dp[i]+A[i]);
		}
		chmax(dp[i+1],dp[i]);
	}
	return dp[N];
}

void solve();

//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<ll> A(N);
	rep(i,N){
		cin>>A[i];
	}
	ll ans=0;
	rep(roop,3){
		chmax(ans,f(N,A));
		rep(i,N-1) swap(A[i],A[i+1]);
	}
	cout<<ans<<"\n";
}