#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>>>

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...);
}

using mint = modint998244353;

void debug_mint1(vector<mint>& vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>>& vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N, S, T;
    cin >> N >> S >> T;
    vector<ll> E(S);
    vector<ll> R(T);
    for (ll i = 0; i < S; i++) {
        cin >> E[i];
        E[i]--;
    }
    for (ll i = 0; i < T; i++) {
        cin >> R[i];
        R[i]--;
    }
    vector<ll> teams(N, -1);
    for (ll i = 0; i < S; i++) {
        teams[E[i]] = 0;
    }
    for (ll i = 0; i < T; i++) {
        teams[R[i]] = 1;
    }

    vector<vector<ll>> C(N, vector<ll>(N));
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j < N; j++) {
            cin >> C[i][j];
        }
    }

    mf_graph<ll> graph(2 * N * N + N + 2);
    ll offset = 0;

    for (ll i = 0; i < N; i++) {
        for (ll j = i + 1; j < N; j++) {
            offset += 2 * C[i][j];
        }
    }

    ll INF = 1000000000000023;

    for (ll i = 0; i < N; i++) {
        if (teams[i] == -1) {
            graph.add_edge(2 * N * N + N, i, 0);
            graph.add_edge(i, 2 * N * N + N + 1, 0);
        } else if (teams[i] == 0) {
            graph.add_edge(2 * N * N + N, i, INF);
            graph.add_edge(i, 2 * N * N + N + 1, 0);
        } else {
            graph.add_edge(2 * N * N + N, i, 0);
            graph.add_edge(i, 2 * N * N + N + 1, INF);
        }
    }
    for (ll i = 0; i < N; i++) {
        for (ll j = i + 1; j < N; j++) {
            graph.add_edge(2 * N * N + N, N + i * N + j, C[i][j]);
            graph.add_edge(N + i * N + j, i, INF);
            graph.add_edge(N + i * N + j, j, INF);

            graph.add_edge(i, N + N * N + i * N + j, INF);
            graph.add_edge(j, N + N * N + i * N + j, INF);
            graph.add_edge(N + N * N + i * N + j, 2 * N * N + N + 1, C[i][j]);
        }
    }

    ll fl = graph.flow(2 * N * N + N, 2 * N * N + N + 1);
    cout << offset - fl << endl;
}