#include <bits/stdc++.h>
#include <atcoder/mincostflow>
using namespace std;
int main(){
  int K, N, M;
  cin >> K >> N >> M;
  vector<int> A(K);
  for (int i = 0; i < K; i++){
    cin >> A[i];
    A[i]--;
  }
  vector<int> B(N);
  for (int i = 0; i < N; i++){
    cin >> B[i];
  }
  vector<int> U(M), V(M);
  vector<long long> D(M);
  for (int i = 0; i < M; i++){
    cin >> U[i] >> V[i] >> D[i];
    U[i]--;
    V[i]--;
  }
  atcoder::mcf_graph<int, long long> G(N + 2);
  for (int i = 0; i < K; i++){
    G.add_edge(N, A[i], 1, 0);
  }
  for (int i = 0; i < M; i++){
    G.add_edge(U[i], V[i], K, D[i]);
    G.add_edge(V[i], U[i], K, D[i]);
  }
  for (int i = 0; i < N; i++){
    G.add_edge(i, N + 1, B[i], 0);
  }
  cout << G.flow(N, N + 1).second << endl;
}