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

constexpr int64_t INF = 1LL << 60;

int main() {
    atcoder::mf_graph<int64_t> graph(402);
    int N;
    std::cin >> N;
    std::vector<int> P(N);
    for (int i = 0; i < N; i++) {
        std::cin >> P[i];
        if (P[i] > 0) graph.add_edge(0, i + 1, P[i]);
        else graph.add_edge(i + 1, 401, -P[i]);
    }
    int M;
    std::cin >> M;
    for (int i = 0; i < M; i++) {
        int U, V;
        std::cin >> U >> V;
        graph.add_edge(V, U, INF);
    }
    int K;
    std::cin >> K;
    std::vector<int> A(K), B(K), S(K);
    for (int i = 0; i < K; i++) {
        std::cin >> A[i] >> B[i] >> S[i];
        graph.add_edge(0, i + 201, S[i]);
        graph.add_edge(i + 201, A[i], INF);
        graph.add_edge(i + 201, B[i], INF);
    }
    graph.flow(0, 401);
    auto selected = graph.min_cut(0);
    int64_t profit = 0;
    for (int i = 0; i < N; i++) {
        if (selected[i + 1]) profit += P[i];
    }
    for (int i = 0; i < K; i++) {
        if (selected[A[i] - 1] && selected[B[i] - 1]) profit += S[i];
    }
    std::cout << profit << std::endl;
}