import sys
from collections import deque, Counter
from math import gcd, log10, pi, sqrt, ceil
from bisect import bisect, bisect_left, bisect_right, insort
from typing import Iterable, TypeVar, Union, Tuple, Iterator, List
import copy
import heapq
import itertools
import math
import random
from fractions import Fraction
from functools import lru_cache, partial, cmp_to_key
import operator
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
mod = 998244353
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]


class Flow:
    def __init__(self, V):
        self.V = V
        self.G = [dict() for _ in range(V)]

    def add_edge(self, u, v, cap):
        self.G[u][v] = cap 
        self.G[v][u] = 0

    def add_multi_edge(self, u, v, cap1, cap2):
        self.G[u][v] = cap1
        self.G[v][u] = cap2

    def wfs(self, s, g):
        S = [(s, -1, INF)]
        P = [-1] * self.V
        while S:
            u, p, f = S.pop()
            if u == g:
                break
            
            for v, c in self.G[u].items():
                if c <= 0:
                    continue
    
                if P[v] != -1:
                    continue
    
                t = min(f, c)
                P[v] = u
                S.append((v, u, t))
        else:
            return 0

        while u != s:
            p = P[u]
            self.G[p][u] -= f
            self.G[u][p] += f
            u = p
    
        return f

    def flow(self, s, g):
        res = 0
        r = self.wfs(s, g)
        while r > 0:
            res += r
            r = self.wfs(s, g)
        return res


def main():
    N, S, T = read_values()
    A = list(read_index())
    B = list(read_index())

    C = read_lists(N)

    fg = Flow(N)
    for i in range(N):
        for j in range(i + 1, N):
            fg.add_multi_edge(i, j, C[i][j], C[i][j])
    
    for a in A[1:]:
        fg.add_edge(A[0], a, INF)
    for b in B[1:]:
        fg.add_edge(b, B[0], INF)

    print(fg.flow(A[0], B[0]))


if __name__ == "__main__":
    main()