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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}";
}
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")";
}
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

struct se{
  vector<ll> st;
  int si;
  void init(int n) {
    si = 1;
    while(si < 2 * n + 2)
      si *= 2;
    st.resize(si);
  }
  void ins(int x, ll y) {
    x += si / 2;
    st[x] = y;
    x /= 2;
    while(x) {
      st[x] = st[x * 2] + st[x * 2 + 1];
      x /= 2;
    }
  }
  ll gs(int l, int r) {
    l += si / 2;
    r += si / 2;
    ll su = 0;
    while(l <= r) {
      if(l&1)
        su += st[l++];
      if(!(r&1))
        su += st[r--];
      l /= 2;
      r /= 2;
    }
    return su;
  }
  int daj(ll su) {
    int p = 1;
    while(p * 2 < sz(st)) {
      if(st[p * 2] <= su) {
        su -= st[p * 2];
        p = p * 2 + 1;
      }
      else {
        p = p * 2;
      }
    }
    return p - si / 2;
  }
};

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n;
  cin >> n;
  --n;
  vector<ll> v(n);
  for(auto &i : v)
    cin >> i;

  se st;
  st.init(n);

  rep(i, 0, n)
    st.ins(i, v[i]);

  ll su = accumulate(all(v), 0LL);

  auto sol = [&] () {
    int ptr = st.daj(su / 2);
    debug(ptr);
    ll res = su; 
    for(int i = ptr - 1; i <= ptr + 1; i++) {
      if(i < 0 || i >= n)
        continue;
      ll le = st.gs(0, i);
      debug(i, le);
      res = min(res, max(le, su - le) - min(le, su - le));
    }
    return res;
  };

  int q;
  cin >> q;

  cout << sol() << endl;
  rep(_, 0, q) {
    int a, b;
    cin >> a >> b;
    --a;
    st.ins(a, b);
    su -= v[a];
    su += v[a] = b;
    debug(v);
    cout << sol() << endl;
  }

}