#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}


int main(){
  int N,X,Y; cin >> N >> X >> Y;
  vector<int> A(X),B(Y);
  rep(i,X) cin >> A[i];
  rep(i,X) A[i]--;
  rep(i,Y) cin >> B[i];
  rep(i,Y) B[i]--;
  vector<vector<ll>> C(N,vector<ll>(N));
  rep(i,N) rep(j,N) cin >> C[i][j];
  ll sum = 0;
  rep(i,N) rep(j,N) sum += C[i][j];
  sum /= 2;
  atcoder::mf_graph<ll> G(N+2);
  int S = N, T = N+1;
  ll inf = 1LL<<60;
  rep(i,X){
    G.add_edge(S,A[i],inf);
  }
  rep(i,Y){
    G.add_edge(B[i],T,inf);
  }
  rep(i,N){
    rep(j,N){
      G.add_edge(i,j,C[i][j]);
    }
  }
  cout << sum - G.flow(S,T) << endl;
  return 0;
}