#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define all(x) (x).begin(),(x).end()
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<llint, llint> P;

ll T;
ll n;
ll a[250005];
ll dp[200005];

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

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> T;
	while(T--){
		cin >> n;
		rep(i, 1, n) cin >> a[i];
		a[n+1] = a[1], a[n+2] = a[2], a[n+3] = a[3];
		
		ll ans = 0;
		rep(p, 1, 3){
			rep(i, 0, n) dp[i] = -inf;
			dp[0] = 0;
			rep(i, 0, n-1){
				chmax(dp[i+1], dp[i]);
				if(i+3 <= n && check(a[i+1], a[i+2], a[i+3])) chmax(dp[i+3], dp[i]+a[i+1]);
			}
			chmax(ans, dp[n]);
			
			rep(i, 1, n+3) a[i] = a[i+1];
		}
		cout << ans << endl;
	}
	
	return 0;
}