#ifndef COMMON_H
#define COMMON_H 1
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#include <random>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define szx(x) (int)(x).size()
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
constexpr int LOG2(int x)
{
    return 32 - __builtin_clz(x) - 1;
}
#endif // COMMON_H
#ifndef DEBUG_H
#define DEBUG_H 1
#ifndef CLown1331
#define debug(...) 0
#define ASSERT(...) 0
#define dbg(...) 0
#endif
#endif // DEBUG_H
#ifndef solution_h
#define solution_h 1
namespace solution
{
const int sz = 2e5 + 105;
const int mod = 1e9 + 7;
const ll INF = 1e12;
int t, n;
ll ar[sz];
ll dp[sz][5][5][5];
int vis[sz][5][5][5];
int vs = 0;
ll rec(int x, int a, int b, int c)
{
    if (x == n)
    {
        return 0;
    }
    ll &ret = dp[x][a][b][c];
    if (vis[x][a][b][c] == vs)
    {
        return ret;
    }
    ret = INF;
    vis[x][a][b][c] = vs;
    for (int i = 0; i < 5; i++)
    {
        if (i == b || i == c)
        {
            continue;
        }
        ret = min(ret, rec(x + 1, b, c, i) + ar[x] * i);
    }
    return ret;
}
void solve_case()
{
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%lld", &ar[i]);
    }
    ll ans = INF;
    vs++;
    for (int i = 0; i < 5; i++)
    {
        for (int j = 0; j < 5; j++)
        {
            if (i == j)
            {
                continue;
            }
            for (int k = 0; k < 5; k++)
            {
                if (i == k || j == k)
                {
                    continue;
                }
                ans = min(ans, rec(3, i, j, k) + ar[0] * i + ar[1] * j + ar[2] * k);
            }
        }
    }
    printf("%lld\n", ans);
}
void solve()
{
    vs = 0;
    scanf("%d", &t);
    while (t--)
    {
        solve_case();
    }
}
} // namespace solution
#endif // solution_h
#define _CRT_SECURE_NO_WARNINGS
int main()
{
    solution::solve();
    return 0;
}