#include<bits/stdc++.h>
using namespace std;

using ll =long long;

#include<atcoder/maxflow>
using namespace atcoder;

const ll INF=1e15;
void solve(){
    ll N;
    cin>>N;
    mf_graph<ll> G(N+202);
    ll S=0;
    for(int i=0;i<N;i++){
        ll X;
        cin>>X;
        if(X>=0){
            S+=X;
            G.add_edge(i,N+1,X);
        }
        else{
            G.add_edge(N,i,-X);
        }
    }
    ll M;
    cin>>M;
    for(int i=0;i<M;i++){
        ll u,v;
        cin>>u>>v;
        u--;v--;
        G.add_edge(v,u,INF);
    }
    cin>>M;
    
    ll c=N+2;
    for(int i=0;i<M;i++){
        ll u,v,w;
        cin>>u>>v>>w;
        u--;v--;
        S+=w;
        G.add_edge(c,N+1,w);
        G.add_edge(u,c,INF);
        G.add_edge(v,c,INF);
        c++;
    }
    cout<<S-G.flow(N,N+1)<<endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T=1;
    // cin>>T;
    while(T--)solve();
}