#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
// typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
bool f = false;
ll a[mx];
ll loog[mx];
pi st[mx][20];
ll timer = 1;
ll en[mx];
ll dep[mx];
ll to[mx][20];
ll pd[mx];
ll le[mx];
ll re[mx];
ll dp[2][mx];
vector<pi> v[mx];
typedef struct binary_indexed_tree{
vi arr;
ll range,sm;
void init(ll k){
range = 4 * k;
arr.resize(range);
fip(0,range)
arr[i] = 0;
return;
}
void update(ll ptr,ll val){
for(ll i = ptr; i <= n ; i += (i&(-i)))
arr[i] += val;
return;
}
ll get(ll ptr){
sm = 0;
for(ll i = ptr; i > 0 ; i -= (i&(-i)))
sm += arr[i];
return sm;
}
}BIT;
BIT bit;
void dfs(ll u){
if(le[u]!=-1){
dfs(le[u]);
dp[0][u] += dp[1][le[u]];
}
if(re[u]!=-1){
dfs(re[u]);
dp[0][u] += dp[1][re[u]];
}
dp[1][u] = dp[0][u];
fx(v[u])
dp[1][u] = max(dp[1][u],dp[0][u] + bit.get(pd[x.ff]) + x.ss);
bit.update(u,dp[0][u] - dp[1][u]);
bit.update(en[u]+1,dp[1][u] - dp[0][u]);
return;
}
pi get(ll l,ll r){
tptp = loog[r-l+1];
return max(st[l][tptp],st[r-(1<<tptp)+1][tptp]);
}
ll divide(ll l,ll r,ll p){
if(r<l)return -1;
ll id = timer;
timer++;
to[id][0] = p;
fjp(1,20)
to[id][j] = to[to[id][j-1]][j-1];
pi pp = get(l,r);
le[id] = divide(l,pp.ss-1,id);
re[id] = divide(pp.ss+1,r,id);
pd[pp.ss] = id;
dep[id] = pp.ff + 1;
en[id] = timer - 1;
return id;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input1.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
// freopen("error1.txt", "w", stderr);
// #endif // ONLINE_JUDGE
loog[0] = loog[1] = 0;
fip(2,mx)
loog[i] = loog[i>>1] + 1;
cin>>n;
fip(0,n){
cin>>a[i];
st[i][0] = {a[i],i};
}
bit.init(n);
fjp(1,20)
fip(0,n){
if(i+(1<<j)-1<n)
st[i][j] = max(st[i][j-1],st[i+(1<<(j-1))][j-1]);
}
to[1][0] = 1;
divide(0,n-1,1);
ans = 0;
ll x,y,cc;
cin>>m;
fip(0,m){
cin>>x>>y>>cc;
x--;
ans += cc;
tp = pd[x];
fjn(19,0)
if(dep[to[tp][j]]<=y)
tp = to[tp][j];
v[tp].push_back({x,cc});
}
dfs(1);
cout<<ans-dp[1][1]<<nli;
cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
