#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a))
#define MEM_1(a) memset((a),-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define COMPRESS(a) sort(ALL(a));a.resize(unique(ALL(a))-a.begin())
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };
int a[200005];
VPi yy[200005];
Vi v[200005];
int lg[200005],d[200005][18];
int mn(int l,int r){
int k=lg[r-l+1];
return min(d[l][k],d[r-(1<<k)+1][k]);
}
priority_queue<pair<int,Pi>> q;
ll tree[200005];
void upd(int i, int k){
while (i <= 200000){
tree[i] += k;
i += (i&-i);
}
}
ll sum(int i){
ll c = 0;
while (i > 0){
c += tree[i];
i -= (i&-i);
}
return c;
}
ll dfs(int l,int r,int k){
if(l>r)return 0;
int m=mn(l,r);
ll ret=0;
int pr=l;
for(auto it=lower_bound(ALL(v[m]),l);it!=v[m].end() && *it<=r;it++){
ret+=dfs(pr,*it-1,m);
pr=*it+1;
}
ret+=dfs(pr,r,m);
for(auto it=lower_bound(ALL(v[m]),l);it!=v[m].end() && *it<=r;it++){
int y=*it;
while(!yy[y].empty()){
auto [x,c]=yy[y].back();
q.push(mp(x,mp(y,c)));
yy[y].pop_back();
}
}
ll res=ret;
while(!q.empty() && q.top().X>k){
auto [y,c]=q.top().Y;
q.pop();
res=max(res,ret+c-sum(y));
}
upd(l,res-ret);
upd(r+1,ret-res);
return res;
}
int main(){
fup(i,1,17,1)lg[1<<i]=i;
fup(i,2,200000,1)if(!lg[i])lg[i]=lg[i-1];
int n,m;
scanf("%d",&n);
fup(i,1,n,1){
scanf("%d",a+i);
a[i]=n-a[i]+1;
d[i][0]=a[i];
v[a[i]].pb(i);
}
fup(j,0,16,1){
fup(i,1,n,1){
if(i+(1<<(j+1))>n+1)break;
d[i][j+1]=min(d[i][j],d[i+(1<<j)][j]);
}
}
ll sum=0;
scanf("%d",&m);
fup(i,0,m-1,1){
int x,y,z;
scanf("%d%d%d",&y,&x,&z);
sum+=z;
x=n+2-x;
yy[y].pb(mp(x,z));
}
printf("%lld\n",sum-dfs(1,n,0));
}
