#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

void dijkstra(vvpll &graph, ll v, vl &dist) {
    priority_queue<pll, vpll, greater<pll>> pque;
    pque.push(pll(0, v));
    dist[v] = 0;
    while (pque.size()) {
        pll p = pque.top();
        pque.pop();
        if (dist[p.second] != p.first) {
            continue;
        }
        for (auto x : graph[p.second]) {
            if (dist[x.first] > dist[p.second] + x.second) {
                dist[x.first] = dist[p.second] + x.second;
                pque.push(pll(dist[x.first], x.first));
            }
        }
    }
}

int main() {
    ll K, N, M;
    cin >> K >> N >> M;
    vector<ll> A(K);
    vector<ll> B(N);
    for (ll i = 0; i < K; i++) {
        cin >> A[i];
        A[i]--;
    }
    for (ll i = 0; i < N; i++) {
        cin >> B[i];
    }
    vector<ll> U(M);
    vector<ll> V(M);
    vector<ll> D(M);
    for (ll i = 0; i < M; i++) {
        cin >> U[i] >> V[i] >> D[i];
        U[i]--;
        V[i]--;
    }
    // debug(A);
    vector<vector<pll>> graph(N, vector<pll>(0));
    for (ll i = 0; i < M; i++) {
        graph[U[i]].push_back(pll(V[i], D[i]));
        graph[V[i]].push_back(pll(U[i], D[i]));
    }
    ll INF = 1000000000000000002;
    vector<vector<ll>> dist(N, vector<ll>(N, INF));
    for (ll i = 0; i < N; i++) {
        dijkstra(graph, i, dist[i]);
    }
    // debug(dist);
    mcf_graph<ll, ll> graph2(N + N + 2);
    for (ll i = 0; i < K; i++) {
        graph2.add_edge(N + N, A[i], 1, 0);
    }
    for (ll i = 0; i < N; i++) {
        graph2.add_edge(N + i, N + N + 1, B[i], 0);
    }
    for (ll i = 0; i < K; i++) {
        for (ll j = 0; j < N; j++) {
            graph2.add_edge(A[i], N + j, 1, dist[A[i]][j]);
        }
    }
    pll cost = graph2.flow(N + N, N + N + 1);
    cout << cost.second << endl;
}