#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

template <typename T>
Vec<tuple<i32, i32, T>> runlength(const Vec<T> &a) {
    if (a.empty()) {
        return Vec<tuple<i32, i32, T>>();
    }
    Vec<tuple<i32, i32, T>> ret;
    i32 prv = 0;
    REP(i, 1, a.size()) {
        if (a[i - 1] != a[i]) {
            ret.emplace_back(prv, i, a[i - 1]);
            prv = i;
        }
    }
    ret.emplace_back(prv, (i32)a.size(), a.back());
    return ret;
}

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

// ============

#include <atcoder/maxflow>

// rev?

template <typename T>
class ProjectSelectionProblem {
    int n;
    T all;
    atcoder::mf_graph<T> graph;
    
public:
    ProjectSelectionProblem(int n) : n(n), all(0), graph(n + 2) {}
    
    void add_0(T v) {
        all += v;
    }
    
    void add_1(int i, T f0, T f1) {
        if (f0 <= f1) {
            graph.add_edge(n, i, f1 - f0);
            add_0(f0);
        } else {
            graph.add_edge(i, n + 1, f0 - f1);
            add_0(f1);
        }
    }
    
    void add_2(int i, int j, T f00, T f01, T f10, T f11) {
        if (i == j) {
            add_1(i, f00, f11);
            return;
        }
        assert(f01 + f10 >= f00 + f11);
        add_0(f00);
        add_1(i, 0, f10 - f00);
        add_1(j, 0, f11 - f10);
        graph.add_edge(i, j, f01 + f10 - f00 - f11);
    }
    
    T solve() {
        T f = graph.flow(n, n + 1);
        return all + f;
    }
    
    std::vector<bool> assign() {
        std::vector<bool> a = graph.min_cut(n);
        a.resize(n);
        for (int i = 0; i < n; ++i) {
            a[i] = !a[i];
        }
        return a;
    }
};
// ============

int main() {
    i32 n, s, t;
    cin >> n >> s >> t;
    Vec<i32> team(n, -1);
    REP(i, s) {
        i32 e;
        cin >> e;
        --e;
        team[e] = 0;
    }
    REP(i, t) {
        i32 r;
        cin >> r;
        --r;
        team[r] = 1;
    }
    Vec<Vec<i64>> c(n, Vec<i64>(n));
    REP(i, n) REP(j, n) {
        cin >> c[i][j];
    }
    ProjectSelectionProblem<i64> psp(n);
    REP(i, n) {
        if (team[i] == 0) {
            psp.add_1(i, 0, INF64);
        }
        if (team[i] == 1)  {
            psp.add_1(i, INF64, 0);
        }
    }
    REP(i, n) REP(j, i) {
        psp.add_2(i, j, -c[i][j], 0, 0, -c[i][j]);
    }
    i64 ans = -psp.solve();
    cout << ans << '\n';
}