#include <iostream>
#include <vector>
#include <limits>
using namespace std;

using int64 = long long;

template <typename T>
class segment_tree {
public:
    segment_tree(int n_) : n(__lowest_power_of_2(n_)), dat(n * 2, 0), lazy(n * 2, 0) {}

    template <typename Iterator>
    segment_tree(Iterator left, Iterator right)
        : n(__lowest_power_of_2(std::distance(left, right))), dat(n * 2, 0), lazy(n * 2, 0) {
        std::copy(left + n, right + n, dat.begin());
        for (int i = n - 1; i >= 1; --i) {
            dat[i] = dat[i * 2] + dat[i * 2 + 1];
        }
    }

private:
    int n;
    std::vector<T> dat, lazy;
    static const T INF = std::numeric_limits<T>::max() / 2;

public:
    void add(int ql, int qr, const T &x) { __add(1, 0, n, ql, qr, x); }

    T max(int ql, int qr) { return __max(1, 0, n, ql, qr); }

private:
    void __flush_lazy(int v) {
        dat[v] += lazy[v];
        if (v < n) {
            lazy[v * 2] += lazy[v];
            lazy[v * 2 + 1] += lazy[v];
        }
        lazy[v] = 0;
    }

    void __update_dat(int v) { dat[v] = std::max(dat[v * 2], dat[v * 2 + 1]); }

    void __add(int n, int l, int r, const int ql, const int qr, const T &x) {
        __flush_lazy(n);
        if (r <= ql || qr <= l) {
            return;
        } else if (ql <= l && r <= qr) {
            lazy[n] += x;
            __flush_lazy(n);
        } else {
            int m = (l + r) / 2;
            __add(n * 2, l, m, ql, qr, x);
            __add(n * 2 + 1, m, r, ql, qr, x);
            __update_dat(n);
        }
    }

    T __max(int n, int l, int r, const int ql, const int qr) {
        __flush_lazy(n);
        if (r <= ql || qr <= l) {
            return -INF;
        } else if (ql <= l && r <= qr) {
            return dat[n];
        } else {
            int m = (l + r) / 2;
            T res_left = __max(n * 2, l, m, ql, qr);
            T res_right = __max(n * 2 + 1, m, r, ql, qr);
            __update_dat(n);
            return std::max(res_left, res_right);
        }
    }

    int __lowest_power_of_2(int x) const {
        int res = 1;
        while (res < x) res <<= 1;
        return res;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;

    vector<int64> T(N - 1);
    for (int i = 0; i < N - 1; i++) {
        cin >> T[i];
        T[i] -= 3 * i;
    }
    segment_tree<int64> segtree(T.size());
    for (int i = 0; i < N - 1; i++) {
        segtree.add(i, i + 1, T[i]);
    }
    
    /*
    cerr << "T: " << endl;
    for (int i = 0; i < N - 1; i++) {
        cerr << segtree.max(i, i + 1) << endl;
    }
    */

    int M;
    cin >> M;
    for (int i = 0; i < M; i++) {
        int L, R, D;
        cin >> L >> R >> D;
        L--; R--;

        segtree.add(L, R + 1, D);
        int64 d = segtree.max(0, N - 1);

        /*
        */

        // cerr << "d: " << d << endl;

        cout << 3 * (N - 1) + d << endl;
    }
    return 0;
}