#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/maxflow>

void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<ll> P(N);
    rep(i, 0, N) cin >> P[i];
    int M;
    cin >> M;
    vector<int> U(M), V(M);
    rep(i, 0, M) cin >> U[i] >> V[i], U[i]--, V[i]--;
    int K;
    cin >> K;
    vector<int> A(K), B(K), S(K);
    rep(i, 0, K) cin >> A[i] >> B[i] >> S[i], A[i]--, B[i]--;
    atcoder::mf_graph<ll> G(N + 2 + K);
    int st = N + K, en = st + 1;
    ll ans = 0;
    rep(i, 0, N){
        if (P[i] <= 0){
            G.add_edge(i, en, -P[i]);
        }
        else{
            G.add_edge(st, i, P[i]);
            ans += P[i];
        }
    }
    rep(i, 0, M){
        G.add_edge(V[i], U[i], ILL);
    }
    rep(i, 0, K){
        ans += S[i];
        G.add_edge(st, i + N, S[i]);
        G.add_edge(i + N, A[i], ILL);
        G.add_edge(i + N, B[i], ILL);
    }
    ans -= G.flow(st, en);
    cout << ans << "\n";
}