#include <bits/stdc++.h>

#ifdef ONLINE_JUDGE
#include "candies.h"
#endif

#define mid ((l + r) >> 1)
#define mkp(a, b) std::make_pair(a, b)

const int N = 2e5 + 10;

int64_t a[N];

std::vector<std::pair<int, int>> opt[N];

int64_t Max[N << 2], Min[N << 2], sum[N << 2];

inline void upd(int k) {
    Max[k] = Max[k << 1];
    Max[k] = std::max(Max[k << 1], sum[k << 1] + Max[k << 1 | 1]);
    Min[k] = std::min(Min[k << 1], sum[k << 1] + Min[k << 1 | 1]);
    sum[k] = sum[k << 1] + sum[k << 1 | 1];
}

inline void mod(int k, int l, int r, int p, int dat) {
    if (l <= p && p <= r) {
        if (l == r) {
            sum[k] = Max[k] = Min[k] = dat;
            return;
        }

        mod(k << 1, l, mid, p, dat);
        mod(k << 1 | 1, mid + 1, r, p, dat);
        upd(k);
    }
}

int64_t Sum, curmin, curmax;

inline void query(int k, int l, int r, int c) {
    if (l == r) {
        Sum += sum[k];
        // curmin = std::min(curmin, Min[k]);
        // curmax = std::max(curmax, Max[k]);
        return;
    }

    int64_t nowmin = std::min(curmin, Sum + Min[k << 1 | 1] + sum[k << 1]);
    int64_t nowmax = std::max(curmax, Sum + Max[k << 1 | 1] + sum[k << 1]);

    if (nowmax - nowmin > c) {
        Sum += sum[k << 1];
        query(k << 1 | 1, mid + 1, r, c);
    } else {
        curmin = nowmin;
        curmax = nowmax;
        query(k << 1, l, mid, c);
    }
}

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l, std::vector<int> r,
                                    std::vector<int> v) {
    int n = c.size(), m = v.size();
    std::vector<int> ans(n);

    for (int i = 0; i < m; ++i)
        mod(1, 0, m - 1, i, 0);

    for (int i = 0; i < m; ++i) {
        opt[l[i]].emplace_back(i + 2, v[i]);
        opt[r[i] + 1].emplace_back(i + 2, 0);
    }

    m += 2;
    mod(1, 0, m - 1, 0, 1e9);
    mod(1, 0, m - 1, 1, 0);

    for (int i = 0; i < n; ++i) {
        for (auto x : opt[i])
            mod(1, 0, m - 1, x.first, x.second);

        Sum = 0, curmin = curmax = sum[1];
        query(1, 0, m - 1, c[i]);

        if (Sum < curmin)
            ans[i] = (int64_t)c[i] - (curmax - sum[1]);
        else
            ans[i] = sum[1] - curmin;
    }

    return ans;
}

#ifndef ONLINE_JUDGE

int main() {
    int n;
    assert(1 == scanf("%d", &n));
    std::vector<int> c(n);

    for (int i = 0; i < n; ++i)
        assert(scanf("%d", &c[i]) == 1);

    int q;
    assert(1 == scanf("%d", &q));
    std::vector<int> l(q), r(q), v(q);

    for (int i = 0; i < q; ++i)
        assert(scanf("%d %d %d", &l[i], &r[i], &v[i]) == 3);

    std::vector<int> ans = distribute_candies(c, l, r, v);

    for (int i = 0; i < n; ++i) {
        if (i > 0)
            printf(" ");

        printf("%d", ans[i]);
    }

    printf("\n");
    fclose(stdout);
    return 0;
}

#endif