import sys input = sys.stdin.buffer.readline class LazySegTree: """ https://tjkendev.github.io/procon-library/python/range_query/rmq_raq_segment_tree_lp.html より拝借し、一部改変しています。 """ def __init__(self, N): # N: 処理する区間の長さ self.N = N self.LV = (self.N - 1).bit_length() self.N0 = 2 ** self.LV self.data = [0] * (2 * self.N0) self.lazy = [0] * (2 * self.N0) def gindex(self, l, r): L = (l + self.N0) >> 1 R = (r + self.N0) >> 1 lc = 0 if l & 1 else (L & -L).bit_length() rc = 0 if r & 1 else (R & -R).bit_length() for i in range(self.LV): if rc <= i: yield R if L < R and lc <= i: yield L L >>= 1 R >>= 1 # 遅延伝搬処理 def propagates(self, *ids): for i in reversed(ids): v = self.lazy[i - 1] if not v: continue self.lazy[2 * i - 1] += v self.lazy[2 * i] += v self.data[2 * i - 1] += v self.data[2 * i] += v self.lazy[i - 1] = 0 # 区間[l, r)にxを加算 def update(self, l, r, x): *ids, = self.gindex(l, r) self.propagates(*ids) L = self.N0 + l R = self.N0 + r while L < R: if R & 1: R -= 1 self.lazy[R - 1] += x self.data[R - 1] += x if L & 1: self.lazy[L - 1] += x self.data[L - 1] += x L += 1 L >>= 1 R >>= 1 for i in ids: self.data[i - 1] = max(self.data[2 * i - 1], self.data[2 * i]) # 区間[l, r)内の最大値を求める def query(self, l, r): self.propagates(*self.gindex(l, r)) L = self.N0 + l R = self.N0 + r s = 0 while L < R: if R & 1: R -= 1 s = max(s, self.data[R - 1]) if L & 1: s = max(s, self.data[L - 1]) L += 1 L >>= 1 R >>= 1 return s N = int(input()) S = LazySegTree(N) req_time = 3 T = map(int, input().split()) for i, t in enumerate(T): S.update(i + 1, i + 2, t - req_time * i) M = int(input()) for _ in range(M): l, r, d = map(int, input().split()) S.update(l, r + 1, d) print(S.data[1] + req_time * (N - 1))