#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx2,abm,popcnt")

using namespace std;

typedef int ll;

void add(vector<ll>& arr, ll l, ll r, ll x) {
	for (ll i = l; i <= r; i++) {
		arr[i] += x;
	}
}

void smax0(vector<ll>& arr, ll l, ll r) {
	for (int i = l; i <= r; i++) {
		arr[i] = max(0, arr[i]);
	}
}

void smin(vector<ll>& arr, vector<ll>& c, ll l, ll r) {
	for (ll i = l; i <= r; i++) {
		arr[i] = min(c[i], arr[i]);
	}
}

vector<ll> distribute_candies(vector<ll> c, vector<ll> l, vector<ll> r, vector<ll> v) {
	ll n = c.size(), q = v.size();
	vector<ll> ans(n, 0);
	for (ll i = 0; i < q; i++) {
		add(ans, l[i], r[i], v[i]);
		smax0(ans, l[i], r[i]);
		smin(ans, c, l[i], r[i]);
	}
	return ans;
}

#ifdef LOCAL
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