#include <bits/stdc++.h>

using namespace std;
using ll = long long int;
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define pii pair<ll, ll>
#define vll vector<long long int>
#define pb push_back
#define ss second
#define ff first
#define fl(i, n) for (ll i = 0; i < n; i++)
#define fl1(i, n) for (ll i = 1; i < n; i++)
#define flc(a, b) for (ll i = a; i <= b; i++)
#define flr(a, b) for (ll i = a; i >= b; i--)
#define nl "\n"
#define br cout << "\n";
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

// #define mod 1000000007;

const int N = 100005;
ll SIZE = 0;


void print(vll &v)
{
    for (auto x : v)
        cout << x << " ";
    cout << endl;
}



ll t = 1;
void solve()
{
    ll n; cin >> n;
    vll v(n+2,0),sum(n+2,0); fl(i,n) cin >> v[i+1];

    for ( ll i = 1; i <= n; i++){
        if(v[i] == 0){
            sum[i] = 0;
        }else{
            ll j = i, temp =0;

            while(v[j] != 0){
                temp += v[j++];
            }
            
            for ( i ; i<j ; i++) sum[i] = temp;
        }
    }
    //print(sum);

    ll q ; cin >> q;

    while(q--){
        ll pos,update; cin >> pos >> update;

        if(v[pos] == 0){
            cout << sum[pos-1] + sum[pos+1] + update << nl;
        }
        else{
            cout << sum[pos] - v[pos] + update << nl;
        }
    }

}

int main()
{
    // freopen ("input.txt", "r", stdin);
    // freopen ("output.txt", "w", stdout);
    //ios::sync_with_stdio(false); cin.tie (NULL); cout.tie(NULL);

       

    int Test = 1;
    // cin >> Test;
    while (Test--)
    {
        solve();
    }
    return 0;
}