#include<bits/stdc++.h>
using namespace std;
using ll =long long;

#include<atcoder/dsu>
using namespace atcoder;


void solve(){
	ll N;
	cin>>N;
	dsu d(N);
	vector<ll> A(N),C(N);
	for(int i=0;i<N;i++){
		cin>>A[i];
		C[i]=A[i];
		if(i>0&&A[i-1]>0&&A[i]>0){
			ll z=C[d.leader(i-1)]+C[d.leader(i)];
			d.merge(i-1,i);
			C[d.leader(i)]=z;
		}
	}
	ll Q;
	cin>>Q;
	for(int i=0;i<Q;i++){
		ll x,b;
		cin>>x>>b;
		x--;
		ll an=C[d.leader(x)]-A[x]+b;
		if(x>0&&!d.same(x,x-1))an+=C[d.leader(x-1)];
		if(x<N-1&&!d.same(x,x+1))an+=C[d.leader(x+1)];
		cout<<an<<"\n";
	}
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);


	int T=1;
	// cin>>T;
	while(T--)solve();
	
}