# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

n, r, c = MI()
x = LI()
y = LI()
z = LI()
get = [x, y, z]

s = LI()

# これ定数倍 2^3 かけていいということだよね？落ちたらふつうに殴る
n0 = n + 2
e = [[] for i in range(8 * n0)]

# get をぜんぶとる
for i in range(n):
    for bit in range(8):
        for j in range(3):
            if bit >> j & 1 == 0:
                nbit = bit ^ (1 << j)
                e[bit*n0 + i].append((nbit*n0 + i, get[j][i]))

# 船
for bit in range(8):
    if bit >> 2 & 1:
        e[bit*n0+n].append((bit*n0+n+1, c))
        for i in range(n):
            e[bit*n0+i].append((bit*n0+n, s[i]))
            e[bit*n0+n+1].append((bit*n0+i, s[i]))

for i in range(r):
    u, v, w, a, m = MI()
    u -= 1
    v -= 1
    for bit in range(8):
        e[bit*n0+u].append((bit*n0+v, w))
        e[bit*n0+v].append((bit*n0+u, w))
        if bit >> 0 & 1:
            e[bit*n0+u].append((bit*n0+v, a))
            e[bit*n0+v].append((bit*n0+u, a))
        if bit >> 1 & 1:
            e[bit*n0+u].append((bit*n0+v, min(a, m)))
            e[bit*n0+v].append((bit*n0+u, min(a, m)))

d = [inf] * (8 * n0)
d[0] = 0
que = [(0, 0)]

while que:
    nd, u = heappop(que)
    if d[u] != nd: continue
    
    for v, w in e[u]:
        if d[v] > nd + w:
            d[v] = nd + w
            heappush(que, (nd + w, v))

ans = inf
for bit in range(8):
    ans = min(ans, d[bit*n0+n-1])
print(ans)