#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <ios>
#include <iomanip>
#include <queue>
#include <numeric>
#include <map>
#include <set>
#include <sstream>
#include <bitset>
#include <climits>
#include <stack>
#include <regex>
#include <functional>
#include <random>
#ifdef _WIN64
#  include <atcoder/all>
#endif
#ifdef _MSC_VER
#  include <intrin.h>
#  define __builtin_popcount __popcnt
#  define __builtin_popcountl __popcnt64
#endif

using namespace std;

#define ll long long
#define rep(i, init, n) for(ll i = init; i < (ll)n; i++)
#define rrep(i, init, n) for(ll i = init; i >= (ll)n; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) (ll)(x.size())
#define Out(x) cout << x << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define Ans cout << ans << endl
#define PI 3.14159265358979
#define MOD 998244353

const int inf32 = INT_MAX / 2;
const ll inf64 = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }

// -------------------------------------------------------------------------------------------------

int main()
{
	int t; cin >> t;

	vector<ll> ans;
	while (t--)
	{
		int n; cin >> n;
		vector<ll> a(n + 1);
		rep(i, 1, n + 1) cin >> a[i];

		auto solve = [&]()
		{
			vector dp(n + 1, -inf64);
			dp[0] = dp[1] = dp[2] = 0;

			rep(i, 3, n + 1)
			{
				chmax(dp[i], dp[i - 1]);

				if (a[i - 2] == a[i - 1] || a[i - 1] == a[i] || a[i - 2] == a[i]) continue;

				if ((a[i - 2] < a[i - 1] && a[i - 1] > a[i]) || (a[i - 2] > a[i - 1] && a[i - 1] < a[i]))
				{
					chmax(dp[i], dp[i - 3] + a[i - 2]);
				}
			}

			return dp[n];
		};

		ll tmp = -inf64;
		rep(i, 0, 3)
		{
			a.push_back(a[1]);
			a.erase(a.begin() + 1);
			chmax(tmp, solve());
		}

		ans.push_back(tmp);
	}

	for (ll a : ans) Out(a);

	return 0;
}