#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
//mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
struct SegmentTree{
int n;
vector<pair<int, int>> a;
SegmentTree(int _n, vector<int> b){
n = _n;
a.resize(n*2+2, {0, 0});
for(int i = 1; i<= n; ++i) a[i+n] = make_pair(b[i], i);
for(int i = n; i >= 1; --i) a[i] = max(a[i * 2], a[i * 2 + 1]);
}
pair<int, int> get(int l, int r){
l += n; r += n + 1;
pair<int, int> ans = {0, 0};
while(l < r){
if (l & 1) maximize(ans, a[l++]);
if (r & 1) maximize(ans, a[--r]);
l >>= 1; r >>= 1;
}
return ans;
}
};
const int N = 2e5 + 69, LOG_N = 2e5 + 69;
int n, m;
vector<int> b;
vector<pair<int, ll>> stars[N];
vector<pair<int, ll>> dp[LOG_N];
void ascension(vector<pair<int, ll>> &arr){
sort(ALL(arr), [](pair<int, ll> x, pair<int, ll> y){
if (x.first != y.first) return x.first < y.first;
return x.second > y.second;
});
ll ma = -1;
vector<pair<int, ll>> ans;
for(pair<int, ll> i:arr)
if (maximize(ma, i.second))
ans.push_back(i);
arr = ans;
}
void gate_keep(vector<pair<int, ll>> &arr, int lobo){
ll ma = 0;
reverse(ALL(arr));
while(arr.size() && arr.back().first <= lobo){
maximize(ma, arr.back().second);
arr.pop_back();
}
arr.push_back(make_pair(lobo, ma));
reverse(ALL(arr));
}
void dnc(int l, int r, SegmentTree &st, int layer){
if (l > r) return;
array<pair<int, int>, 3> range;
int mid = st.get(l, r).second;
// range[0] = {l, mid - 1}, range[1] = {mid, mid}, range[2] = {mid+1, r};
// sort(ALL(range), [](pair<int, int> x, pair<int, int> y){return x.second - x.first > y.second - y.first;});
dp[layer] = stars[mid];
ascension(dp[layer]);
dp[layer+1].clear();
dnc(l, mid-1, st, layer + 1);
vector<pair<int, ll>> left = dp[layer + 1];
dp[layer+1].clear();
dnc(mid+1, r, st, layer + 1);
vector<pair<int, ll>> right = dp[layer + 1];
gate_keep(dp[layer], b[mid]);
gate_keep(left, b[mid]);
gate_keep(right, b[mid]);
ll sum = dp[layer][0].second + left[0].second + right[0].second;
for(int it = 0; it < 3; ++it){
ll diff = sum - dp[layer][0].second;
for(auto &i: dp[layer]){
i.second += diff;
}
swap(dp[layer], left);
swap(left, right);
}
for(pair<int, ll> i: left) dp[layer].push_back(i);
for(pair<int, ll> i: right) dp[layer].push_back(i);
ascension(dp[layer]);
}
void solve(){
cin >> n;
b.resize(n+1);
for(int i = 1; i <= n; ++i) cin >> b[i];
cin >> m;
ll sum = 0;
for(int i = 0; i < m; ++i){
int x, y, z; cin >> x >> y >> z;
stars[x].push_back(make_pair(y, z));
sum += z;
}
SegmentTree st(n, b);
dnc(1, n, st, 0);
ll ans = sum;
if (dp[0].size()) ans -= dp[0].back().second;
cout << ans << "\n";
}
int main(void){
ios::sync_with_stdio(0); cout.tie(0); cin.tie(0);
clock_t start = clock();
solve();
cerr << "Time elapsed: " << clock() - start << "ms!\n";
return 0;
}
