#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;++i)
#define per(i,n) for(int i=n;i>=1;--i)
#define pb push_back
#define mp make_pair
#define N 210000
#define inf 1000000000
int n;
int a[N];
long long st[4*N];
int lowbit(int x)
{
	return x & (-x);
}
void add(int x,long long p)
{
	while (x<=n-1)
	{
		st[x]+=p;
		x+=lowbit(x);
	}
}
long long get(int x)
{
	long long ret=0;
	while (x>0)
	{
		ret+=st[x];
		x-=lowbit(x);
	}
	return ret;
}
long long getsum(int l,int r)
{
	return get(r)-get(l-1);
}
long long getans()
{
	int l=1,r=n;
	while (l<r)
	{
		int mid=(l+r)/2;
		if (getsum(1,mid-1)*2>=st[1])r=mid;
		else l=mid+1;
	}
	long long ans=2147483647ll*100000ll,ansp;
	for(int i=max(1,l-2);i<=min(n,l+2);i++)
	{
		long long wait=abs(getsum(1,i-1)-getsum(i,n-1));
		if (wait<ans)ans=wait,ansp=i;
	}
	return ans;
}
int main()
{
	cin>>n;
	rep(i,n-1)scanf("%d",&a[i]);
	rep(i,n-1)add(i,a[i]);
	printf("%lld\n",getans());
	int q; cin>>q;
	while (q--)
	{
		int x,y; scanf("%d%d",&x,&y);
		add(x,y-a[x]);
		a[x]=y;
		printf("%lld\n",getans());
	}
}