// S2OJ Submission #1179 @ 1706603378706
#include <bits/stdc++.h>
using namespace std;

struct dsu {
	vector<int> next;
	dsu(int n) : next(n + 2) {
		for (int i = 0; i <= n + 1; i++)
			next[i] = i; 
	}
	int find(int x) {
		return next[x] == x ? x : next[x] = find(next[x]);
	}
};

struct fenwick {
	vector<long long> a;
	fenwick(int n) : a(n + 1) {
	}
	long long sum(int i) {
		long long ans = 0;
		while (i > 0)
			ans += a[i], i -= i & -i;
		return ans;
	}
	void add(int i, long long x) {
		while (i < a.size()) {
			a[i] += x;
			i += i & -i;
		}
	}
};
int main() {
#ifdef LOCAL
	freopen("input.txt", "r", stdin);
#endif
	int n;
	cin >> n;
	vector<vector<int>> z(n + 1);
	for (int i = 1; i <= n; i++) {
		int a;
		cin >> a;
		z[a].push_back(i);
	}
	int m;
	cin >> m;
	vector<vector<pair<int,int>>> star(n + 1);
	for (int i = 0; i < m; i++) {
		int x, y, c;
		cin >> x >> y >> c;
		star[y].push_back({x, c});
	}
	fenwick cost(n);
	dsu L(n), R(n);
	long long ans = 0;
	for (int y = 1; y <= n; y++) {
		for (auto s : star[y]) {
			int x = s.first, c = s.second;
			long long C = cost.sum(x);
			if (c <= C) ans += c;
			else {
				ans += C;
				int l = L.find(x), r = R.find(x);
				cost.add(l + 1, c - C);
				cost.add(r, C - c);
			} 
		}
		for  (int x : z[y]) {
			L.next[x] = x - 1;
			R.next[x] = x + 1; 
		}
	}
	cout << ans << '\n';
	return 0;
}