#include <iostream>
using std::cerr, std::cin, std::cout, std::endl, std::fixed, std::flush;
#include <vector>
using std::vector;
static_assert(sizeof(long) == 8);
#include <atcoder/maxflow>
using namespace atcoder;
constexpr long LINF = 4'610'000'000'000'000'000;
int main()
{
  int N;
  cin >> N;
  vector<long> P(N);
  for (int i = 0; i < N; i++)
  {
    cin >> P[i];
  }
  int M;
  cin >> M;
  vector<long> U(M), V(M);
  for (int i = 0; i < M; i++)
  {
    cin >> U[i] >> V[i];
    U[i]--, V[i]--;
  }
  int K;
  cin >> K;
  vector<long> A(K), B(K), S(K);
  for (int i = 0; i < K; i++)
  {
    cin >> A[i] >> B[i] >> S[i];
    A[i]--, B[i]--;
  }

  mf_graph<long> g(N + K + 2);
  long geta = 0;
  for (int i = 0; i < N; i++)
  {
    if (P[i] > 0)
    {
      geta += 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], LINF);
  }
  for (int i = 0; i < K; i++)
  {
    geta += S[i];
    g.add_edge(N + i, N + K + 1, 0);
    g.add_edge(N + K, N + i, S[i]);
    g.add_edge(N + i, A[i], LINF);
    g.add_edge(N + i, B[i], LINF);
  }
  cout << geta - g.flow(N + K, N + K + 1) << '\n';
  return 0;
}
/*
  File : ~/kyopro/yukicoder/554/3201.cpp
  Date : 2025/07/11
  Time : 22:03:40
*/