#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int k, n, m;
    cin >> k >> n >> m;
    vector<int> a(k), b(n);
    rep(i,k){
        cin >> a[i];
        --a[i];
    }
    rep(i,n) cin >> b[i];
    const ll INF = 1e18;
    vector<vector<P>> g(n);
    rep(i,m){
        int u, v;
        ll d;
        cin >> u >> v >> d;
        --u;--v;
        g[u].emplace_back(v,d);
        g[v].emplace_back(u,d);
    } 
    vector<int> cnt(n);
    vector<vector<ll>> mdist(n, vector<ll>(n));
    rep(i,n){
        vector<ll> dist(n, INF);
        dist[i] = 0;
        priority_queue<P, vector<P>, greater<P>> pq;
        pq.emplace(dist[i], i);
        while(!pq.empty()){
            auto [D, u] = pq.top();pq.pop();
            if(D!=dist[u]) continue;
            for(auto [v, d] : g[u]){
                if(dist[v]>dist[u] + d){
                    dist[v] = dist[u] + d;
                    pq.emplace(dist[v], v);
                }
            }
        }
        rep(j,n){
            mdist[j][i] = dist[j];
        }
    }
    vector<int> used(n);
    dbg(mdist);
    rep(i,k){
        used[a[i]]++;
    }
    mcf_graph<ll, ll> G(2*n+2);
    int s = 2*n;
    int t = 2*n+1;
    rep(i,n){
        G.add_edge(s, i, used[i], 0);
    }
    rep(i,n){
        rep(j,n){
            G.add_edge(i, j+n, used[i], mdist[i][j]);
        }
    }
    rep(i,n){
        G.add_edge(i+n, t, b[i], 0);
    }
    cout << G.flow(s,t, k).second << endl;
    dbg(G.flow(s, t,k).second);
    return 0;
}