#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto& i:a)
#define ff first 
#define ss second 
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define pb push_back
using ll =long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
template<class T> inline bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T> inline bool chmax(T& a,T b){return a<b?a=b,1:0;}

const int INFI=numeric_limits<int>::max()/2;
const ll INFL=numeric_limits<ll>::max()/2;
int n;
vll a;

void solve(){
    ll k{};
    ll sum{};
    rep(i,0,n){
        chmax(k,a[i]);
        sum+=a[i];
    }
    if((sum-k)<=k){
        cout<<(sum-k+min(k,sum-k+1))<<endl;
    }else{
        cout<<sum<<endl;
    }
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int t;
    cin>>t;
    while(t--){
        cin>>n;
        a.resize(n);
        rep(i,0,n){
            cin>>a[i];
        }
        solve();
    }
    return 0;
}
/*
*/