#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
using namespace std;

typedef long long ll;
struct LazySegmentTree {
public:
	int n;
	vector<ll> node, lazy;

	LazySegmentTree(vector<ll> v) {
		int sz = (int)v.size();
		n = 1; while (n < sz) n *= 2;
		node.resize(2 * n - 1, -2e9);
		lazy.resize(2 * n - 1, 0);

		for (int i = 0; i<sz; i++) node[i + n - 1] = v[i];
		for (int i = n - 2; i >= 0; i--) node[i] = max(node[i * 2 + 1], node[i * 2 + 2]);
	}

	void lazyEvaluate(int k, int l, int r) {
		node[k] += lazy[k];
		if (r - l > 1) {
			lazy[k * 2 + 1] += lazy[k];
			lazy[k * 2 + 2] += lazy[k];
		}
		lazy[k] = 0;
	}

	void update(int a, int b, ll x, int k = 0, int l = 0, int r = -1) {
		if (r < 0) r = n;
		lazyEvaluate(k, l, r);
		if (b <= l || r <= a) return;
		if (a <= l && r <= b) {
			lazy[k] += x;
			lazyEvaluate(k, l, r);
		}
		else {
			update(a, b, x, 2 * k + 1, l, (l + r) / 2);
			update(a, b, x, 2 * k + 2, (l + r) / 2, r);
			node[k] = max(node[2 * k + 1], node[2 * k + 2]);
		}
	}

	ll find(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0) r = n;
		lazyEvaluate(k, l, r);
		if (b <= l || r <= a) return -2e9;
		if (a <= l && r <= b) return node[k];
		ll vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
		ll vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
		node[k] = max(node[2 * k + 1], node[2 * k + 2]);
		return max(vl, vr);
	}
};


int main()
{
	int N; cin >> N;
	vector<ll>T(N-1);
	for (int i = 0; i < N-1; i++)cin >> T[i];
	for (int i = 0; i < N-1; i++)T[i] -= 3 * i;

	ll ans = 3 * (N - 1);

	LazySegmentTree lst(T);


	int M; cin >> M;
	for (int i = 0; i < M; i++) {
		int l, r, d; cin >> l >> r >> d;
		l--;

		lst.update(l, r, d);
		cout << 3 * (N - 1) + lst.find(0, N - 1) << endl;
	}


    return 0;
}