#include <bits/stdc++.h>
#include <atcoder/lazysegtree>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
ll op(ll a, ll b) { return max(a,b);}
ll e() {return -1e18;}
ll comp(ll f, ll g) { return f+g;}
ll mapp(ll f, ll x) { return f + x; }
ll id() { return 0; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N;
	cin >> N;
	vector<ll>T(N-1);
	rep(i,N-1)cin>>T[i];
	rep(i,N-1)T[i] -= 3 * (i+1);
	atcoder::lazy_segtree<ll,op,e,ll,mapp,comp,id> seg(T);
	int M;cin>>M;
	rep(i,M){
		int l, r, d;
		cin >> l >> r >> d;
		l--;
		seg.apply(l,r,d);
		ll ans = seg.all_prod() + 3 * N;
		cout<<ans<<endl;
	}
}