#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

struct Fast {
  Fast() {
    std::cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << setprecision(10);
  }
} fast;

#define all(a) (a).begin(), (a).end()
#define contains(a, x) ((a).find(x) != (a).end())
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (a); i--)
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";

template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
  for (int i = 0; i < vec.size(); i++) {
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  }
  return os;
}

using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;

using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vm>;
inline ostream &operator<<(ostream &os, const mint P) { return os << P.val(); };

void solve() {
  int k, n, m;
  cin >> k >> n >> m;

  mcf_graph<ll, ll> g(n + 2);
  rep(i, 0, k) {
    int a;
    cin >> a;
    a--;
    g.add_edge(n, a, 1, 0);
  }
  rep(i, 0, n) {
    int b;
    cin >> b;
    g.add_edge(i, n + 1, b, 0);
  }
  rep(i, 0, m) {
    int u, v;
    ll d;
    cin >> u >> v >> d;
    u--;
    v--;
    g.add_edge(u, v, k, d);
    g.add_edge(v, u, k, d);
  }

  cout << g.flow(n, n + 1).second << "\n";
}

int main() {
  int t = 1;
  // cin >> t;
  while (t--) solve();
}