#include "atcoder/modint.hpp"
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint1000000007;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  _main();
}

i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  i64 t = x % m;
  while (n > 0) {
    if (n & 1) {
      res = res * t % m;
    }
    t = t * t % m;
    n >>= 1;
  }
  return res;
}

void _main() {
  i64 n;
  cin >> n;
  vector<i64> p(n);
  for (i64 i = 0; i < n; i++) cin >> p[i];
  i64 m;
  cin >> m;
  vector<p2> uv(m);
  for (i64 i = 0; i < m; i++) {
    i64 u, v;
    cin >> u >> v;
    u--, v--;
    uv[i] = {u, v};
  }
  i64 k;
  cin >> k;
  vector<el> abs(k);
  for (i64 i = 0; i < k; i++) {
    i64 a, b, s;
    cin >> a >> b >> s;
    a--, b--;
    abs[i] = {a, b, s};
  }
  atcoder::mf_graph<i64> g(n + k + 2);
  i64 ans = 0;
  for (i64 i = 0; i < n; i++) {
    if (p[i] > 0) {
      ans += p[i];
      g.add_edge(n + k, i, p[i]);
    } else if (p[i] < 0) {
      g.add_edge(i, n + k + 1, -p[i]);
    }
  }
  for (i64 i = 0; i < m; i++) {
    auto [u, v] = uv[i];
    g.add_edge(v, u, 1e15);
  }
  for (i64 i = 0; i < k; i++) {
    auto [a, b, s] = abs[i];
    ans += s;
    g.add_edge(n + k, n + i, s);
    g.add_edge(n + i, a, 1e15);
    g.add_edge(n + i, b, 1e15);
  }
  i64 f = g.flow(n + k, n + k + 1);
  cout << ans - f << "\n";
}