#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<bitset>
#include<iomanip>
#include<list>
using namespace std;
typedef unsigned long long int ulint;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define RE return 0
//ios::sync_with_stdio(false);
//std::cin.tie(0);
//<< setprecision(20)
const int mod=1e9+7;
const llint big=1e15+100;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
template <class T> void soun(T& ar)
{sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());}
llint gcd(llint a,llint b){if(a%b==0){return b;}else{return gcd(b,a%b);}}
llint lcm(llint a,llint b){return a/gcd(a,b) *b;}
template<class T,class U> auto LB(T& ve,U in){return lower_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto UB(T& ve,U in){return upper_bound(ve.begin(),ve.end(),in);}
template<class T,class U> auto LBI(T& ve,U in){return LB(ve,in)-ve.begin();}
template<class T,class U> auto UBI(T& ve,U in){return UB(ve,in)-ve.begin();}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
class seg_tree{
public:
	vector<llint>val;//遅延
	vector<llint>sai;//最大
	seg_tree(void){val.res(262144);sai.res(262144);}
	void cha(int bas,llint d){
		int bi=bas+131072;
		while(bi>0){
			if(bi%2==1){val[bi-1]+=d;sai[bi-1]+=d;}
			bi/=2;
			sai[bi]=val[bi]+max(sai[bi+bi],sai[bi+bi+1]);
		}
	}
	llint que(void){return sai[1];}
};
int main(void){
	int n,i;cin>>n;n--;
	seg_tree ki;
	for(i=0;i<n;i++){
		llint t;cin>>t;
		t+=(n-i)*3;
		ki.cha(i+1,t);
		ki.cha(i,-t);
	}
	int m;cin>>m;
	while(m--){
		int l,r;llint d;cin>>l>>r>>d;l--;
		ki.cha(r,d);
		ki.cha(l,-d);
		cout<<ki.que()<<endl;
	}
	RE;
}