#include<bits/stdc++.h>
using namespace std;
#define nl "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ull unsigned ll
#define RV  return void
#define inf 2000000000
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Mini(x) *min_element(all(x))
#define Maxi(x) *max_element(all(x))
#define fixed(n) fixed << setprecision(n)
// #define ceil(w, m) (((w) / (m)) + ((w) % (m) ? 1 : 0))
#define cin(v) for (auto&i:v) cin >> i;
#define cout(v) for (auto&i:v) cout << i << " ";
#define clr(memo, x) memset(memo, x, sizeof memo)
#define updmin(a, b) a = min(a, b)
#define updmax(a, b) a = max(a, b)
#define vi vector < int >
#define vl vector < ll >
#define vc vector < char >
#define vs vector < string >
#define v2i vector < vector < int > >
#define v2l vector < vector < int > >
#define seti set < int >
#define setl set < ll >
#define mapii map < int , int >
#define mapll map < ll , ll >
#define mapli map < ll , int >
#define mapci map < char , int >
#define mapsi map < string , int >
#define pll pair < ll , ll >
#define pii pair < int , int >
#define range(l,r,x) for(int i=l ; i < r ; i+=x)
#define FastCode ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
vector < string > ternary= {"NO\n" , "YES\n"};

void  Zainab(){
            #ifndef ONLINE_JUDGE
              freopen("input.txt", "r", stdin);
              freopen("output.txt", "w", stdout);
            #endif
}


/*================================  Prblem solution  ================================ */






void myCode(){

    int n ;
    cin >> n ;
    vector < ll > v(n);
    cin(v);


    multiset < ll > vals , diff ;
    for(auto& x : v ) vals.insert(x);

    ll pre = *vals.begin();
    bool start = 0;

    for(auto& x : vals){
        if(start) diff.insert(x - pre);
        start =1;
        pre = x;
    }

    // for(auto& i : vals) cout << i << " ";
    // cout << nl;

    // for(auto& i : diff) cout << i << " ";
    // cout << nl;

    int q;       cin >> q;
    while(q--){
        int idx ,  val;
        cin >> idx >> val ;
        idx--;

        if( n == 1 ) {
            cout << val << " " ;
            continue;
        }

        auto it = vals.find(v[idx]);
        // vals.erase(it);
        // cout << *next(it) << " ";


        if( v[idx] == *vals.rbegin() ){  // last element  -> erase from right only
            diff.erase( diff.find( v[idx] - *prev(it) ));
        }

        else if(v[idx] == *vals.begin()){ // first element  -> erase from left only
            diff.erase( diff.find( *next(it) - v[idx] ));
        }

        else{  // left & right

            diff.erase( diff.find( v[idx] - *prev(it) ));
            diff.erase( diff.find( *next(it) - v[idx] ));
            diff.insert(*next(it) - *prev(it));
        }

        vals.erase(it);
        vals.insert(val);

        v[idx]= val;
        it = vals.find(v[idx]);



        if( v[idx] == *vals.rbegin()){
            diff.insert(  v[idx] - *prev(it) );
        }
        else if( v[idx] == *vals.begin()){
            diff.insert ( *next(it) - v[idx] );
        }

        else{
            diff.insert( v[idx] - *prev(it) );
            diff.insert( *next(it) - v[idx] );
            diff.erase( diff.find(*next(it) - *prev(it)));
        }


        cout << *vals.rbegin() + *diff.rbegin() << " ";


    }

    cout << nl;


}


int main(){
                                   FastCode ;
                              //      Zainab() ;

    int testCase=1;
          cin >> testCase ;
      for(int i=1 ; i<= testCase ; i++)
        myCode();

    return 0;
}