#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001
#define sq 1300


int main(){
	int N,S,T;
	cin>>N>>S>>T;
	vector<int> x(S),y(T);
	rep(i,S){
		cin>>x[i];
		x[i]--;
	}
	rep(i,T){
		cin>>y[i];
		y[i]--;
	}
	sort(x.begin(),x.end());
	sort(y.begin(),y.end());
	int n = N;
	mf_graph<long long> G(N+2);
	S = n;
	T = n+1;
	long long ans = 0;
	rep(i,n){
		rep(j,n){
			int a;
			cin>>a;
			if(i==j)continue;
			G.add_edge(i,j,a);
			if(i<j)ans += a;
		}
	}
	rep(i,n){
		if(binary_search(x.begin(),x.end(),i)){
			G.add_edge(S,i,Inf64);
			G.add_edge(i,T,0);
		}
		else if(binary_search(y.begin(),y.end(),i)){
			G.add_edge(S,i,0);
			G.add_edge(i,T,Inf64);
		}
		else{
			G.add_edge(S,i,0);
			G.add_edge(i,T,0);
		}
	}
	//cout<<G.flow(S,T)<<endl;
	ans -= G.flow(S,T);
	cout<<ans<<endl;	
	
	
	return 0;
}