#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 

typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};

#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

const ll BIG = 1e9;

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);

    int N; cin >> N;
    vector<ll> P(N);
    rep(i, N) cin >> P[i];

    mf_graph<ll> g(N + 2);
    int st = N, en = N + 1;

    int M; cin >> M;
    rep(i, M){
        int U, V;
        cin >> U >> V;
        U--, V--;
        g.add_edge(st, V, BIG);
        g.add_edge(V, U, INF);
        g.add_edge(U, en, BIG);
    }

    ll ans = 0;
    int K; cin >> K;
    rep(i, K){
        int A, B, S;
        cin >> A >> B >> S;
        A--, B--;
        g.add_edge(st, A, S + BIG);
        g.add_edge(A, B, S + BIG);
        g.add_edge(B, en, BIG);
        ans += S;
    }

    rep(i, N) {
        // g.add_edge(st, i, P[i] + BIG);
        // g.add_edge(i, en, 0 + BIG);
        g.add_edge(st, i, P[i] + BIG);
        g.add_edge(i, en, 0 + BIG);
    }

    ll F = g.flow(st, en);
    cout << BIG * (ll)(N + M + 1) + ans + accumulate(all(P), 0LL) - F << endl;
    debug(F, ans, accumulate(all(P), 0LL));
}