#include <iostream>
constexpr int SIZE=524288, max_N=200001;
long long tree[SIZE];
int t[max_N];

long long read (int L, int R, int cl=0, int cr=SIZE/2-1, int x=1){
    if (cl>=L and cr<=R){
        return tree[x];
    }
    if (cl>R or cr<L)return 0;
    return read(L,R,cl,(cl+cr)/2,x*2)+read(L,R,(cl+cr)/2+1,cr,x*2+1);
}

void update (int x){
    while (x!=0){
        tree[x]=tree[2*x]+tree[2*x+1];
        x/=2;
    }
}

long long result (long long station, long long s){
    long long o1=read(0,station-1);
    long long o2=s-o1;
    return s-2*std::min(o1,o2);
}

long long solve (long long s){
    int cr=1;
    long long taken=0;
    while (cr<SIZE/2){
        if ((taken+tree[cr*2])*2<=s){
            taken+=tree[cr*2];
            cr=cr*2+1;
        }else{
            cr*=2;
        }
    }
    int station=cr-SIZE/2;
    return std::min(result(station,s),result(station+1,s));
}

int main(){
    std::ios_base::sync_with_stdio(false);
    std::cout.tie(0);
    std::cout.tie(0);
    int n;
    std::cin>>n;
    long long s=0;
    for (int i=1; i<n; ++i){
        std::cin>>t[i];
        tree[SIZE/2+i-1]=t[i];
        s+=t[i];
    }
    for (int i=SIZE/2-1; i>=1; --i)tree[i]=tree[2*i]+tree[2*i+1];
    std::cout<<solve(s)<<'\n';
    int k;
    std::cin>>k;
    for (int i=0; i<k; ++i){
        int a, b;
        std::cin>>a>>b;
        tree[SIZE/2+a-1]=b;
        update((SIZE/2+a-1)/2);
        s+=b-t[a];
        t[a]=b;
        std::cout<<solve(s)<<'\n';
    }
}