#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e3 + 5;
int n, a[N], mxc[N][N];
struct segment {
pii seg[4 * N];
void build(int l, int r, int i){
if (l == r) return seg[i] = {a[l], l}, void();
int mid = (l + r) / 2;
build(l, mid, 2 * i), build(mid + 1, r, 2 * i + 1);
seg[i] = max(seg[2 * i], seg[2 * i + 1]);
}
pii query(int l, int r, int i, int ll, int rr){
if (l >= ll && r <= rr) return seg[i];
if (r < ll || l > rr) return {0, 0};
int mid = (l + r) / 2;
return max(query(l, mid, 2 * i, ll, rr), query(mid + 1, r, 2 * i + 1, ll, rr));
}
} seg;
vector <int> dfs(int l, int r){
if (l > r) {
vector <int> dp(n + 1);
return dp;
}
pii mx = seg.query(1, n, 1, l, r);
vector <int> left = dfs(l, mx.second - 1);
vector <int> right = dfs(mx.second + 1, r);
vector <int> dp(n + 1);
for (int i = 1; i <= n; i++) {
if (i > mx.first) dp[i] = max({left[mx.first] + right[i], left[i] + right[mx.first], left[mx.first] + right[mx.first] + mxc[mx.second][i]});
else dp[i] = left[i] + right[i];
}
return dp;
}
void solve(){
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
seg.build(1, n, 1);
int k; cin >> k;
int ans = 0;
for (int i = 1; i <= k; i++) {
int x, y, c; cin >> x >> y >> c;
ans += c;
mxc[x][y] = c;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
mxc[i][j] = max(mxc[i][j], mxc[i][j - 1]);
}
}
vector <int> dp = dfs(1, n);
cout << ans - dp[n];
}
int32_t main(){
iShowSpeed;
// int q; cin >> q; while (q--)
solve();
}
