#include <bits/stdc++.h>

typedef long long ll;

const int N = 4e5;
int pre[N + 5], nxt[N + 5];
ll a[N + 5];

typedef std::pair<ll, int> pii;

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        int n;
        ll ans = 0;
        scanf("%d", &n);
        std::set<pii> st;
        for (int i = 1; i <= n; i++) {
            pre[i] = i == 1 ? n : i - 1;
            nxt[i] = i == n ? 1 : i + 1;
            scanf("%lld", &a[i]);
            st.insert({a[i], i});
        }
        for (int _ = 1; _ < n; _++) {
            auto u = st.begin();
            int idx = u->second;

            int mi;
            if (a[pre[idx]] < a[nxt[idx]]) {
                mi = nxt[idx];
                pre[mi] = pre[idx];
            } else {
                mi = pre[idx];
                nxt[mi] = nxt[idx];
            }
            st.erase({a[idx], idx});
            st.erase({a[mi], mi});
            ans += a[idx];
            a[mi] += a[idx];
            st.insert({a[mi], mi});
        }
        printf("%lld\n", ans);
    }
    return 0;
}