// S2OJ Submission #1197 @ 1706663552162
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 2e5 + 1;
int n, m, ans;
vector<int> z[N];
vector<pair<int, int>> st[N];

struct Bcj {
	 vector<int> fa;
	 Bcj(int num) : fa(num) {for (int i = 1; i <= n; ++i) fa[i] = i;}
	 int find(int x) {return x == fa[x] ? x : find(fa[x]);}
};

struct Szsz {
#define lowbit(i) i & -i
	vector<int> t;
	Szsz(int num) : t(num) {}
	int getsum(int i) {
		int sum = 0;
		for (; i; i -= lowbit(i))
			sum += t[i];
		return sum;
	}
	void add(int i, int x) {
		for (; i <= n; i += lowbit(i))
			t[i] += x;
	}
};

signed main() {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		int a; cin >> a;
		z[a].push_back(i);
	}
	cin >> m;
	for (int i = 1; i <= m; ++i) {
		int x, y, c; cin >> x >> y >> c;
		st[y].push_back(make_pair(x, c));
	}
	Bcj L(N), R(N);
	Szsz cost(N);
	for (int y = 1; y <= n; ++y) {
		for (auto star : st[y]) {
			int x = star.first, c = star.second;
			int C = cost.getsum(x);
			if (c <= C)
				ans += c;
			else {
				ans += C;
				cost.add(L.find(x)+1, c-C);
				cost.add(R.find(x)+1, C-c);
			}
		}
		for (int x : z[y])
			L.fa[x] = x-1, R.fa[x] = x+1;
	}
	cout << ans << endl;
	return 0;
}