#include <bits/stdc++.h>
//#include <chrono>
#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
using P = pair<ll, ll>;
const ll INF = (1LL<<60);

template<class T> bool chmin(T &a, const T &b){
    if(a > b) {a = b; return true;}
    else return false;
}
template<class T> bool chmax(T &a, const T &b){
    if(a < b) {a = b; return true;}
    else return false;
}
template<class T> void my_printv(std::vector<T> v,bool endline = true){
    if(!v.empty()){
        for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";
        std::cout<<v.back();
    }
    if(endline) std::cout<<std::endl;
}

bool judge(vec a){
    return a[0] != a[2] && ((a[0] < a[1] && a[1] > a[2]) || (a[0] > a[1] && a[1] < a[2]));
}

ll solve(int l, vec &cpy_a){
    vec a(N);
    rep(i, N) a[i] = cpy_a[i + l];
    vec dp(N + 1, 0);
    reps(i, 3, N + 1){
        chmax(dp[i], dp[i-1]);
        if(judge({a[i-3], a[i-2], a[i-1]})) chmax(dp[i], dp[i-3] + a[i-3]);
    }
    return dp[N];
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin>>Q;
    rep(_, Q){
        cin>>N;
        vec a(N);
        rep(i, N) cin>>a[i];
        rep(i, 3) a.push_back(a[i]);
        ll res = 0;
        rep(j, 3) chmax(res, solve(j, a));
        cout<<res<<endl;
    }
}