#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];


int main() {
	int T;
	cin >> T;
	while (T--) {
		cin >> n;
		ll sum = 0;
		for (int i = 1; i < n + 1; i++) scanf("%d", w + i), sum += w[i];
		sort(w + 1, w + n + 1);
		printf("%lld\n", min(sum, (sum - w[n]) + (sum - w[n] + 1)));
	}
	return 0;
}