// Om Namah Shivaya
#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;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
ll n,m;
vector<ll> a(N);
vector<array<ll,3>> b(N);
map<array<ll,3>,ll> dp;
ll go(ll l, ll r, ll k){
if(l > r) return 0;
if(l == r){
ll mxc = 0;
rep1(i,m){
auto [x,y,c] = b[i];
if(x == l and y <= k){
amax(mxc,c);
}
}
return mxc;
}
array<ll,3> key = {l,r,k};
if(dp.count(key)) return dp[key];
pll mx = {-1,-1};
for(int i = l; i <= r; ++i){
pll px = {a[i],i};
amax(mx,px);
}
auto [val,ind] = mx;
ll ans = go(l,ind-1,k) + go(ind+1,r,val);
amax(ans,go(l,ind-1,val) + go(ind+1,r,k));
ll best = 0;
rep1(i,m){
auto [x,y,c] = b[i];
if(x == ind and y <= k){
amax(best,c);
}
}
amax(ans, best + go(l,ind-1,val) + go(ind+1,r,val));
return dp[key] = ans;
}
void solve(int test_case)
{
cin >> n;
rep1(i,n) cin >> a[i];
cin >> m;
rep1(i,m) rep(j,3) cin >> b[i][j];
ll sum = 0;
rep1(i,m) sum += b[i][2];
ll ans = sum-go(1,n,n);
cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
