#include <cstdio>
#include <iostream>
#include <algorithm>
#define ll long long
#define lson p << 1
#define rson p << 1 | 1
using namespace std;
const int N = 1e5 + 5;

int n, a[N];

struct node {
	int val, id, type;
	node() {}
	node(int _val, int _id, int _type) : val(_val), id(_id), type(_type) {}
} val[N << 1];

struct matrix {
	ll a[2][2];
	void init() {
		for (int i = 0; i < 2; i++)
			for (int j = 0; j < 2; j++) a[i][j] = 1e18;
	}
} t[N << 2];
matrix operator * (matrix x, matrix y) {
	matrix z;
	z.init();
	for (int k = 0; k < 2; k++)
		for (int i = 0; i < 2; i++)
			for (int j = 0; j < 2; j++) z.a[i][j] = min(z.a[i][j], max(x.a[i][k], y.a[k][j]));
	return z;
}

void pushup(int p) {t[p] = t[lson] * t[rson];}
void build(int p, int l, int r) {
	if (l == r) {
		t[p].init();
		t[p].a[0][1] = 1;
		return;
	}
	int mid = l + r >> 1;
	build(lson, l, mid), build(rson, mid + 1, r);
	pushup(p);
}
void update(int p, int L, int R, int l, int r, int type) {
	if (L == R) return t[p].a[type][0] = r, void();
	int mid = L + R >> 1;
	if (l <= mid) update(lson, L, mid, l, r, type);
	else update(rson, mid + 1, R, l, r, type);
	pushup(p);
}

int main() {
	int T;
	scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		int tot = 0;
		for (int i = 1; i <= n; i++) {
			scanf("%d", &a[i]);
			val[++tot] = node(a[i], i, 0);
			if (i > 1) val[++tot] = node(a[i] + a[i - 1], i, 1);
		}
		if (n == 2) {printf("%lld\n", min(a[1] + a[2], abs(a[1] - a[2]))); continue;}
		sort(val + 1, val + 1 + tot, [&](node x, node y) {return x.val < y.val;});
		build(1, 1, n);
		ll ans = 1e18;
		for (int i = tot; i; i--) update(1, 1, n, val[i].id, val[i].val, val[i].type), ans = min(ans, t[1].a[0][0] - val[i].val);
		printf("%lld\n", ans);
	}
	return 0;
}