#include long long int a[300005]; void solve() { long long int n; scanf("%lld", &n); long long int i; for (i = 0; i < n; i++) scanf("%lld", &a[i]); long long int sum = 0; for (i = 0; i < n; i++) sum += a[i]; long long int max = -1; for (i = 0; i < n; i++) if (max < a[i]) max = a[i]; if (max > sum - max + 1) printf("%lld\n", 2 * (sum - max) + 1); else printf("%lld\n", sum); return; } int main() { int t; scanf("%d", &t); for (; t > 0; t--) solve(); return 0; }