#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, ans = LLONG_MAX;
    cin >> n;
    vector<ll> v(n);
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        v[i] = x;
    }
    
    vector<vector<vector<ll>>> dp(6, vector<vector<ll>> (6, vector<ll> (n, -1)));

    auto rec = [&](auto&& self, int i, int back1, int back2) -> ll {
        if(i >= n) return 0;
        ll &ans = dp[back1][back2][i];
        if(ans != -1) return ans;
        ans = LLONG_MAX;
        for(int time = 1; time <= 5; time++) {
            if(back1 == time or back2 == time) continue;
            ans = min(ans, (v[i] * (time - 1)) + self(self, i + 1, time, back1));
        }
        return ans;
    };

    cout << rec(rec, 0, 0, 0) << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}