#include <bits/stdc++.h>
using namespace std;
bool is_kadomatsu(int a, int b, int c){
  return (b < a && b < c || b > a && b > c) && a != c;
}
int main(){
  int T;
  cin >> T;
  for (int i = 0; i < T; i++){
    int N;
    cin >> N;
    vector<int> A(N);
    for (int j = 0; j < N; j++){
      cin >> A[j];
    }
    long long ans = 0;
    for (int j = 0; j < 3; j++){
      vector<long long> dp(N + 1, 0);
      for (int k = 3; k <= N; k++){
        dp[k] = dp[k - 1];
        if (is_kadomatsu(A[k - 3], A[k - 2], A[k - 1])){
          dp[k] = max(dp[k], dp[k - 3] + A[k - 3]);
        }
      }
      ans = max(ans, dp[N]);
      for (int k = N -  2; k >= 0; k--){
        swap(A[k], A[k + 1]);
      }
    }
    cout << ans << endl;
  }
}