#include <bits/stdc++.h>
#include <atcoder/maxflow>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

const ll INF = (ll)1e18;
void run_case() {
    int N;
    cin >> N;
    vector<ll> P(N);
    rep(i, N) cin >> P[i];

    int M;
    cin >> M;

    vector<pair<int, int>> E(M);
    rep(i, M) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        E[i] = {a, b};
    }

    int K;
    cin >> K;
    vector<int> A(K), B(K);
    vector<ll> S(K);
    rep(i, K) {
        cin >> A[i] >> B[i] >> S[i];
        A[i]--, B[i]--;
    }

    int V = N + K + 2;
    int SRC = N + K, SNK = N + K + 1;
    atcoder::mf_graph<ll> mf(V);

    ll all = 0;

    rep(i, N) {
        if (P[i] >= 0) {
            mf.add_edge(SRC, i, P[i]);
            all += P[i];
        } else {
            mf.add_edge(i, SNK, -P[i]);
        }
    }
    rep(j, K) {
        int yj = N + j;
        if (S[j] >= 0) {
            mf.add_edge(SRC, yj, S[j]);
            all += S[j];
        } else {
            mf.add_edge(yj, SNK, -S[j]);
        }
        mf.add_edge(yj, A[j], INF);
        mf.add_edge(yj, B[j], INF);
    }
    for (auto [a, b] : E) {
        mf.add_edge(b, a, INF);
    }

    ll flow = mf.flow(SRC, SNK);
    ll ans = all - flow;
    cout << ans << "\n";
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    // cin >> T;
    while (T--) run_case();
    return 0;
}