import math
import queue

class Node:
    def __init__(self):
        self.index=None
        self.cost=0
        self.minute=math.inf
        self.edges_to=[]
        self.edges_cost=[]
        self.edges_minute=[]
        self. done=False
    def __lt__(self,opr):
        return self.minute < opr.minute

n=int(input())
c=int(input())
v=int(input())
s=[int(i) for i in input().split()]
t=[int(i) for i in input().split()]
y=[int(i) for i in input().split()]
m=[int(i) for i in input().split()]

global sum
sum=math.inf
nodes=[Node() for i in range(n)]

for i in range(len(s)):
    nodes[s[i]-1].edges_to.append(t[i]-1)
    nodes[s[i]-1].edges_cost.append(y[i])
    nodes[s[i]-1].edges_minute.append(m[i])

nodes[0].minute=0

for i in range(n):
    nodes[i].index=i

def fun(node,cost,minute):
    if node.index==n-1:
        global sum
        if minute<sum and cost<=c:
            sum=minute
        return
    for to in range(len(node.edges_to)):
        fun(nodes[node.edges_to[to]],cost+node.edges_cost[to],node.edges_minute[to]+minute)

    return

fun(nodes[0],0,0)
print(-1 if sum==math.inf else sum)