#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
const int MOD = 1000000007;
//const int MOD = 998244353;
const double PI = 3.14159265358979323846;

void solve(){
    int n;
    cin >> n;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    ll ans = 0;
    auto iskado = [&](int j){
        if(j+2>=n) return false;
        if(a[j] == a[j+1] || a[j] == a[j+2] || a[j+1] == a[j+2]) return false;
        if(max({a[j],a[j+1],a[j+2]}) == a[j+1]) return true;
        if(min({a[j],a[j+1],a[j+2]}) == a[j+1]) return true;
        return false;
    };
    rep(k,3){
        vector<ll> dp(n+1,0);
        vector<ll> cum(n+1,0);
        dp[0] = 0;
        ll res = 0;
        for(int i=0;i<n;i++){
            chmax(res,dp[i]);
            if(iskado(i)){
                chmax(dp[i+3], res + a[i]);
            }
        }
        chmax(res,dp[n]);
        rep(i,n-1) swap(a[i],a[i+1]);
        chmax(ans,res);
    }
    cout << ans << endl;
}

int main(){
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}