/*For today, you happen to be the defeated. But what will you become tomorrow?*/

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define int long long int 
#define dbg if(debugg)
#define F first 
#define S second 

bool debugg = false;

template <typename T>
using order_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());  
const int N = 200005;
int arr[N], dp[N][4][4], n, mx = 7;

int magic(int pos, int m1, int m2)
{
    if(pos > n) return 0;
    if(m1 >= 3) m1 = 0;
    if(m2 >= 3) m2 = 0;
    int &ans = dp[pos][m1][m2];
    if(~ans) return ans;
    ans = magic(pos + 1, m1 + (m1 != 0), m2 + (m2 != 0));
    if(m1 == 0) ans = max(ans, 2 * arr[pos] + magic(pos + 1, 1, m2 + (m2 != 0)));
    if(m2 == 0) ans = max(ans, arr[pos] + magic(pos + 1, m1 + (m1 != 0), 1));
    return ans; 
}

void solve()
{
    cin >> n;
    int sum = 0;
    for(int i = 1; i <= n; i ++){
        cin >> arr[i];
        sum += 2 * arr[i];
    }

    for(int i = 0; i <= n; i ++){
        for(int j = 0; j < 4; j ++){
            for(int k = 0; k < 4; k ++){
                dp[i][j][k] = -1;
            }
        }
    }

    int del = magic(1, 0, 0);
    cout << sum - del << '\n';

}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
        
    int t = 1;
    cin >> t;
    
    while(t--){
        solve();
    }

    return 0;
}