import heapq
T = int(input())
for _ in range(T):
    N = int(input())
    A = list(map(int,input().split()))
    A = sorted(A)
    a = sum(A[:N-1])
    b = A[-1]
    if b>a:
        print(2*a+1)
    else:
        print(a+b)