void main(){
  import std.stdio, std.string, std.conv, std.algorithm;
  
  int n; rd(n);
  auto t=readln.split.to!(long[]);
  assert(t.length==(n-1));

  auto sqd=new SqD(t);
  int q; rd(q);
  while(q--){
    int l, r; long d; rd(l, r, d);
    sqd.radd(l-1, r, d);
    writeln(sqd.rmax(0, n-1));
  }
}

class SqD{
  int sz=1, k=1;
  long[] buc, bucmax, laz;
  import std.algorithm;
  this(long[] a){
    auto n=a.length;
    while(sz*sz<n) sz++;
    bucmax.length=laz.length=sz;
    buc.length=(sz*sz);
    foreach(i; 0..n) buc[i]=a[i]+(n-i)*3;
    foreach(i; 0..sz) bucmax[i]=reduce!(max)(buc[(i*sz)..((i+1)*sz)]);
  }

  void push(int i){
    if(laz[i]>0){
      buc[(i*sz)..((i+1)*sz)]+=laz[i];
      laz[i]=0;      
    }
  }

  void radd(int l, int r, long x){
    for(auto i=l/sz; i<=r/sz && i*sz<sz*sz; i++){
      if(l<=i*sz && (i+1)*sz<=r){
        bucmax[i]+=x; laz[i]+=x;
      }else{
        push(i);
        auto s=max(l, i*sz), t=min(r, (i+1)*sz);
        buc[s..t]+=x;
        if(s<t) bucmax[i]=reduce!(max)(buc[(i*sz)..((i+1)*sz)]);
      }
    }
  }

  long rmax(int l, int r){
    long ret=0;
    for(auto i=l/sz; i<=r/sz && i*sz<sz*sz; i++){
      if(l<=i*sz && (i+1)*sz<=r){
        ret=max(ret, bucmax[i]);
      }else{
        push(i);
        auto s=max(l, i*sz), t=min(r, (i+1)*sz);
        if(s<t) ret=max(ret, reduce!(max)(buc[s..t]));
      }
    }
    return ret;
  }
}

void rd(T...)(ref T x){
  import std.stdio, std.string, std.conv;
  auto l=readln.split;
  assert(l.length==x.length);
  foreach(i, ref e; x){
    e=l[i].to!(typeof(e));
  }
}
void wr(T...)(T x){
  import std.stdio;
  foreach(e; x) write(e, " ");
  writeln();
}