#include <iostream>
using namespace std;
long long a[10001], b[10001], tot[10001];
int m, n, ia = 1, ib = 1, j;
int main() {
	freopen("interval_mod.in", "r", stdin);
	freopen("interval_mod.out", "w", stdout);
	int min,max;
	scanf("%d",&n);
	while (ia <= n) {
		scanf("%lld",&a[ia]);
		ia++;
	}
	ia = 1;
	while (ia <= n) {
		b[ia] = a[ia] - a[ia - 1];
		ia = ia + 1;
	}
	ia = 1;
	scanf("%d",&m);
	while (ia <= m) {
		cin >> min >> max >> j;
		b[min] = b[min] + j;
		b[max + 1] = b[max + 1] - j;
		ia = ia + 1;
	}
	ia = 1;
	while (ia <= n) {
		ib = ia;
		while (ib >= 1) {
			tot[ia] = tot[ia] + b[ib];
			ib = ib - 1;
		}
		ia = ia + 1;
	}
	ia = 1;
	while (ia <= n) {
		printf("%lld ",tot[ia]);
		ia = ia + 1;
	}
}