#include<iostream>
#include<cstdio>
#include<limits>

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,j) FOR(i,0,j)

const int INF = 1001001001;

int N, C, V;
int S[1500], T[1500], Y[1500], M[1500];
int dp[50][301];

int rec(int index, int cost){
    if(index == N-1){return 0;}
    if(dp[index][cost] != -1){return dp[index][cost];}

    int res = INF;
    REP(i, V){
        if(index == S[i] && cost >= Y[i]){
            res = std::min(res, rec(T[i], cost-Y[i]) + M[i]);
        }
    }

    return dp[index][cost] = res;
}

int main(){
    std::cin >> N >> C >> V;
    
    REP(i, V){std::cin >> S[i]; S[i] -= 1;}
    REP(i, V){std::cin >> T[i]; T[i] -= 1;}
    REP(i, V){std::cin >> Y[i];}
    REP(i, V){std::cin >> M[i];}

    std::fill(&dp[0][0], &dp[0][0]+50*301, -1);

    int res = rec(0, C);
    if(res == INF){
        puts("-1");
    }else{
        printf("%d\n", res);
    }
}