let n = Int(readLine()!)!
let c = Int(readLine()!)!
let v = Int(readLine()!)!
let s=readLine()!.split(separator:" ").map({Int($0)!})
let t=readLine()!.split(separator:" ").map({Int($0)!})
let y=readLine()!.split(separator:" ").map({Int($0)!})
let m=readLine()!.split(separator:" ").map({Int($0)!})
var br=[Int:[(Int,Int,Int)]]()
for i in 0..<v {
    let s=s[i]-1,g=t[i]-1,time=m[i],cost=y[i]
    br[s,default:[(Int,Int,Int)]()]+=[(g,time,cost)]
    //有向グラフ
}

func bfs() -> Int {
    let start=0
    var queue = ArraySlice<(Int,Int,Int,Set<Int>)>()
    //node,time,cost,explored
    queue.append((start, 0,0,Set<Int>()))
    var mintime = -1
    while let (curnode, time, cost,explored) = queue.popFirst() {
        if let branches=br[curnode] {
            for (nextnode,timeplus,costplus) in branches {
                if !explored.contains(nextnode) {
                    let newcost=cost+costplus
                    if newcost <= c {
                        let newtime=time+timeplus
                        if nextnode==n-1 {
                            //print("first goal!!")
                            //return newtime
                            if mintime == -1 {
                                mintime=newtime
                            } else {
                                mintime = min(mintime,newtime)
                            }
                        }
                        var newexplored=explored
                        newexplored.insert(nextnode)
                        queue.append((nextnode,newtime,newcost,newexplored))
                    }
                }
            }
        }
    }
    return mintime
}
print(bfs())