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

constexpr int64_t INF = 1LL << 60;

int main() {
    atcoder::mf_graph<int64_t> graph(402);
    int64_t profit = 0;
    int N;
    std::cin >> N;
    for (int i = 1; i <= N; i++) {
        int P;
        std::cin >> P;
        if (P > 0) graph.add_edge(0, i, P), profit += P;
        else graph.add_edge(i, 401, -P);
    }
    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;
    for (int i = 201; i <= K + 200; i++) {
        int A, B, S;
        std::cin >> A >> B >> S;
        profit += S;
        graph.add_edge(0, i, S);
        graph.add_edge(i, A, INF);
        graph.add_edge(i, B, INF);
    }
    std::cout << profit - graph.flow(0, 401) << std::endl;
}