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()]

sum=0
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

q=queue.PriorityQueue()

q.put(nodes[0])
end=False
while not q.empty():
    temp_node=q.get()
    temp_node.done=True

    for to in range(len(temp_node.edges_to)):
        cost=temp_node.cost+temp_node.edges_cost[to]
        minute=temp_node.minute+temp_node.edges_minute[to]
        if nodes[temp_node.edges_to[to]].minute > minute and cost<=c:
            if nodes[temp_node.edges_to[to]].index==n-1:
                sum=minute
                end=True

            nodes[temp_node.edges_to[to]].minute=minute
            nodes[temp_node.edges_to[to]].cost=cost
            if not nodes[temp_node.edges_to[to]] in q.queue:
                q.put(nodes[temp_node.edges_to[to]])

if sum==0:
    if end:
        print(0)
    else:
        print(-1)
else:
    print(sum)