/*

This code template was updated by Yukii_P on 2024/9/20.

*/
#include <bits/stdc++.h>
#define FIO cin.tie(0); ios::sync_with_stdio(false)
#define fi first
#define se second
#define inf 0x3f3f3f3f

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x << "=" << x << '\n'
#else
#define debug(x) 
#endif

using namespace std;
using i64 = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using pii = pair<int, int>;

inline char nc() {
    static char buf[1 << 20], *p1, *p2;
    return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1<<20, stdin), p1 == p2) ? EOF : *p1++;
}
#ifndef ONLINE_JUDGE
#define nc getchar
#endif
void read() {}
template<typename T, typename... T2> 
inline void read(T &x, T2 &... oth) {
    x = 0; char c = nc(), up = c;
    while(!isdigit(c)) up = c, c = nc();
    while(isdigit(c)) x = x * 10 + c - '0', c = nc();
    up == '-' ? x = -x : 0;
    read(oth...);
}

constexpr int N = 2e5 + 10;
constexpr int MOD = 998244353;

i64 a[N], b[N];

void solve() {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        b[(i + 1) % n] = a[i];
    }

    i64 sum1 = 0, sum2 = 0;

    for (int i = 1; i < n; ++i) {
        i64 r1 = min(a[i], a[i-1]);
        i64 r2 = min(b[i], b[i-1]);
        sum1 += r1;
        sum2 += r2;
        a[i] += a[i-1];
        b[i] += b[i-1];
    }
    cout << min(sum1, sum2) << '\n';

}

signed main() {
    
    FIO;
    int t;
    cin >> t;
    while (t--) solve();

    return 0;
}

/*

  _  _      _     _____    _  _    _ __   _                              
 | \| |    (_)   |_   _|  | || |  | '_ \ | |_      ___     ___    _ _    
 | .` |    | |     | |     \_, |  | .__/ | ' \    / _ \   / _ \  | ' \   
 |_|\_|   _|_|_   _|_|_   _|__/   |_|__  |_||_|   \___/   \___/  |_||_|  
_|"""""|_|"""""|_|"""""|_| """"|_|"""""|_|"""""|_|"""""|_|"""""|_|"""""| 
"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-'"`-0-0-' 

"El Psy Kongroo." -- Hououin Kyoma

*/