#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 500010, M = 2510;
int T, n, m, a[N];
struct node{
	int p, s, c;
	int idx;
} b[M];

bool cmp(node x, node y) {
	return x.c < y.c;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	freopen("Stacks.in", "r", stdin);
	freopen("Stacks.out", "w", stdout);
	cin >> T;
	while (T--) {
		cin >> n;
		for (int i = 1; i <= n; i++) cin >> a[i];
		cin >> m;
		for (int i = 1; i <= m; i++) {
			cin >> b[i].p >> b[i].s >> b[i].c;
			b[i].idx = i;
		}
		for (int i = 1; i <= n; i++) {
			int ans = 0;
			sort(b+1, b+1+m, cmp);
			for (int j = 1; j <= m; j++) {
				if (b[j].p <= a[i]) {
					ans += (a[i] - b[j].p + 1) * b[j].c;
					a[i] = b[j].p - 1;
				}
			}
			cout << ans << " ";
		}
		cout << "\n";
	}
	return 0;
}