#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
const int  N = 2e3 + 12, MOD = (int)1e9 + 7;

int n, m, a[N], x[N], y[N], c[N][N], sf[N][N];
ll dp[N][N], s[N];
void test() {
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i] = n - a[i];
    }
    cin >> m;
    ll f = 0;
    for(int i = 1; i <= m; i++) {
        cin >> x[i] >> y[i];
        y[i] = n - y[i] + 1;
        cin >> c[x[i]][y[i]];
        f += c[x[i]][y[i]];
    }
    for(int i = 1; i <= n; i++) {
        for(int j = a[i]; j >= 1; j--) {
            sf[i][j] = max(sf[i][j + 1], c[i][j]);
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= a[i]; j++) {
            // dp[i][j] = dp[i][j - 1];
            if(a[i - 1] >= j) {
                dp[i][j] = max(dp[i][j], dp[i - 1][j] + sf[i - 1][j + 1]);
            } else {
                dp[i][j] = max(dp[i][j], s[i - 1]);
            }
            s[i] = max(s[i], dp[i][j] + c[i][j]);
            // cout << dp[i][j] + c[i][j] << ' ';
        }
        // cout << '\n';
        s[i] = max(s[i - 1], s[i]);
    }

    cout << f - s[n] << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); 

    int t = 1; 
    // cin >> t;

    while(t--) 
        test();

    return 0;
}