#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll inf=INF*INF;
const ll mod=998244353;
const ll MAX=100010;


bool is_k(ll a,ll b,ll c){
    bool f=0;
    if((a>b&&c>b)||(a<b&&c<b))f=1;
    if(a==b||b==c||c==a)f=0;
    return f;
}

signed main(){
    ll t;cin>>t;
    while(t--){
        ll n;cin>>n;
        vector<ll>a(n);
        rep(i,n){
            cin>>a[i];
            a.pb(a[i]);
        }
        ll ans=0;
        {
            vector<ll>dp(2*n);
            if(is_k(a[0],a[1],a[2]))dp[2]=a[0];
            REP(i,3,n){
                if(is_k(a[i-2],a[i-1],a[i])){
                    dp[i]=dp[i-3]+a[i-2];
                }
                dp[i]=max(dp[i-1],dp[i]);
            }
            ans=max(dp[n-1],ans);
        }
        {
            vector<ll>dp(2*n);
            if(is_k(a[1],a[2],a[3]))dp[3]=a[1];
            REP(i,4,n+1){
                if(is_k(a[i-2],a[i-1],a[i])){
                    dp[i]=dp[i-3]+a[i-2];
                }
                dp[i]=max(dp[i-1],dp[i]);
            }
            ans=max(dp[n],ans);
        }
        {
            vector<ll>dp(2*n);
            if(is_k(a[2],a[3],a[4]))dp[4]=a[2];
            REP(i,5,n+2){
                if(is_k(a[i-2],a[i-1],a[i])){
                    dp[i]=dp[i-3]+a[i-2];
                }
                dp[i]=max(dp[i-1],dp[i]);
            }
            ans=max(dp[n+1],ans);
        }
        cout<<ans<<endl;
    }
}