#include <bits/stdc++.h>
#include <cassert>

using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define vvi vector<vi>
#define vll vector<long long>
#define fi first
#define se second
void test_case() {
    int n;
    cin >> n;
    vi a(n);
    for (int i = 0; i < n; i ++) cin >> a[i];

    if (n == 1) {
        cout << a[0] << '\n';
        return;
    }

    if (n == 2) {
        cout << max(a[0], a[1]) << '\n';
        return;
    }

    vi dp(n + 1, 0);
    dp[1] = a[0];
    dp[2] = a[1];

    for (int i = 3; i <= n; i ++) {
        dp[i] = max(dp[i-2] + a[i-1], dp[i-3] + a[i-1] + min(a[i-2], a[i-3]));
    }

    int ans = *max_element(all(dp));
    cout << ans << '\n';
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int tc = 1;
    cin >> tc;
    while(tc--) {
        test_case();
    }
    return 0;
}