#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=2e5+5;
ll n, m, h[nx], x, y, c, sm, l[nx], r[nx], rt, res, lz[nx], mx;
vector<pair<ll, ll>> d[nx];
set<pair<ll, ll>> dp[nx];
stack<ll> s;
void solve(int u)
{
if (l[u]) solve(l[u]);
if (r[u]) solve(r[u]);
ll vl=0, vr=0;
if (l[u]||r[u])
{
if (!l[u]) swap(l[u], r[u]);
if (dp[l[u]].size()<dp[r[u]].size()) swap(l[u], r[u]);
while (!dp[l[u]].empty()&&dp[l[u]].begin()->first<=h[u]) vl=max(vl, dp[l[u]].begin()->second+lz[l[u]]), dp[l[u]].erase(dp[l[u]].begin());
while (!dp[r[u]].empty()&&dp[r[u]].begin()->first<=h[u]) vr=max(vr, dp[r[u]].begin()->second+lz[r[u]]), dp[r[u]].erase(dp[r[u]].begin());
swap(dp[l[u]], dp[u]);
lz[u]=lz[l[u]];
lz[u]+=vr;
dp[u].insert({h[u], vl+vr-lz[u]});
for (auto [y, c]:dp[r[u]]) dp[u].insert({y, c+lz[r[u]]+vl-lz[u]});
}
for (auto [y, c]:d[u]) dp[u].insert({y, c+vl+vr-lz[u]});
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
for (int i=1; i<=n; i++) cin>>h[i];
cin>>m;
for (int i=1; i<=m; i++) cin>>x>>y>>c, d[x].push_back({y, c}), sm+=c;
for (int i=1; i<=n; i++)
{
while (!s.empty()&&h[s.top()]<h[i]) l[i]=s.top(), s.pop();
if (!s.empty()) r[s.top()]=i;
else rt=i;
s.push(i);
}
solve(rt);
for (auto x:dp[rt]) mx=max(mx, x.second+lz[rt]);
cout<<sm-mx;
}
