#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a < b){ a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if(a > b){ a = b; return 1; } return 0; }
template<class T> inline int  sz(T &a) { return a.size(); }
using ll = long long; using ld = long double;
using pi = pair<int,int>; using pl = pair<ll,ll>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
const int inf = numeric_limits<int>::max();
const ll infll = numeric_limits<ll>::max();
int main()
{
  auto check = [](ll a, ll b, ll c)->bool {
    if(a != b && b != c && c != a && ((a < b && b > c) || (a > b && b < c))) return true;
    else return false;
  };
  int q; cin >> q;
  while(q-- > 0) {
    int n; cin >> n;
    vl a(n);
    rep(i,n) cin >> a[i];
    a.push_back(a[0]);
    a.push_back(a[1]);
    ll res = 0;
    vl dp(n+3, 0);
    rep(i,n) {
      if(i+3 <= n && check(a[i], a[i+1], a[i+2])) chmax(dp[i+3], dp[i] + a[i]);
      chmax(dp[i+1], dp[i]);
    }
    chmax(res, dp[n]);
    dp.assign(n+3, 0);
    rep1(i,n) {
      if(i+3 <= n+1 && check(a[i], a[i+1], a[i+2])) chmax(dp[i+3], dp[i] + a[i]);
      chmax(dp[i+1], dp[i]);
    }
    chmax(res, dp[n+1]);
    dp.assign(n+3, 0);
    for(int i = 2; i <= n+1; ++i) {
      if(i+3 <= n+2 && check(a[i], a[i+1], a[i+2])) chmax(dp[i+3], dp[i] + a[i]);
      chmax(dp[i+1], dp[i]);
    }
   chmax(res, dp[n+2]);
    cout << res << "\n";
  }
  return 0;
}