#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
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 (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
bool kad(vector<int> a){
    bool u=false;
    if(a[0]<a[1]&&a[1]>a[2]&&a[0]!=a[2]) u=true;
    if(a[0]>a[1]&&a[1]<a[2]&&a[0]!=a[2]) u=true;
    return u;
}
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int T;cin >> T;
    while(T--){
        int n;cin >> n;
        vector<int> a(n);
        REP(i,n) cin >> a[i];
        vector dp(n+1,vector(3,0LL));
        vector<int> x(3),y(3);
        x[0]=a[n-1],x[1]=a[0],x[2]=a[1];
        y[0]=a[n-2],y[1]=a[n-1],y[2]=a[0];
        if(kad(x)) dp[2][1]=a[n-1];
        if(kad(y)) dp[1][2]=a[n-2];
        REP(i,n){
            REP(j,3){
                chmax(dp[i+1][j],dp[i][j]);
                if(i+3<=n-j){
                    vector<int> z(3);
                    z[0]=a[i],z[1]=a[i+1],z[2]=a[i+2];
                    if(kad(z)) chmax(dp[i+3][j],dp[i][j]+a[i]);
                }
            }
        }
        cout << max({dp[n][0],dp[n][1],dp[n][2]}) << endl;
    }
}