#include <iostream>
#include <atcoder/maxflow>

using namespace std;
using namespace atcoder;

using ll = long long;

constexpr int N = 200;
constexpr int P = 1e9;
constexpr ll INF = 2ll * N * P + 1; 

int main() {
    int n;
    cin >> n;
    int p[n];
    for (int i = 0; i < n; i++) {
        cin >> p[i];
    }
    int m;
    cin >> m;
    int u[m], v[m];
    for (int i = 0; i < m; i++) {
        cin >> u[i] >> v[i];
        u[i]--; v[i]--;
    }
    int k;
    cin >> k;
    int a[k], b[k], s[k];
    for (int i = 0; i < k; i++) {
        cin >> a[i] >> b[i] >> s[i];
        a[i]--; b[i]--;
    }

    ll ans = 0;
    mf_graph<ll> g(n + k + 2);

    for (int i = 0; i < n; i++) {
        if (p[i] >= 0) {
            ans += p[i];
            g.add_edge(n + k, i, p[i]);
            g.add_edge(i, n + k + 1, 0);
        } else {
            g.add_edge(n + k, i, 0);
            g.add_edge(i, n + k + 1, -p[i]);
        }
    }

    for (int i = 0; i < m; i++) {
        g.add_edge(v[i], u[i], INF);
    }

    for (int i = 0; i < k; i++) {
        ans += s[i];
        g.add_edge(n + k, n + i, s[i]);
        g.add_edge(n + i, a[i], INF);
        g.add_edge(n + i, b[i], INF);
    }

    ans -= g.flow(n + k, n + k + 1);
    cout << ans << endl;

    return 0;
}