#include <iostream>
#include <cstdint>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

static inline constexpr uint64_t solve(const uint32_t N, const vector<uint32_t>& A) noexcept
{
	const uint32_t max_A = *max_element(A.begin(), A.end());
	const uint64_t sum_A = accumulate(A.begin(), A.end(), UINT64_C(0));

	if ((max_A << 1) <= sum_A)
		return sum_A;
	else
		return ((sum_A - max_A) << 1) + 1;
}

int main()
{
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	
	uint32_t T, i;
	cin >> T;
	vector<uint32_t> N(T);
	vector<vector<uint32_t>> A(T);
	for (i = 0; i != T; ++i)
	{
		cin >> N[i];
		A[i].resize(N[i]);
		for (uint32_t j = 0; j != N[i]; ++j)
			cin >> A[i][j];
	}

	for (i = 0; i != T; ++i)
		cout << solve(N[i], A[i]) << '\n';

	return 0;
}