// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

int s[1501], t[1501], y[1501], m[1501];
vector<int> edge[51];
int dp[51][301];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, c, v;
  cin >> n >> c >> v;
  rep(i, v)cin >> s[i], s[i]--;
  rep(i, v)cin >> t[i], t[i]--;
  rep(i, v)cin >> y[i];
  rep(i, v)cin >> m[i];
  rep(i, v){
    edge[t[i]].pb(i);
  }
  for(int i = 0; i < n; i++){
    for(int j = 0; j <= c; j++)dp[i][j] = inf;
  }
  for(int j = 0; j <= c; j++)dp[0][j] = 0;
  for(int i = 1; i < n; i++){
    for(int j = 0; j <= c; j++){
      for(int k: edge[i]){
        int from = s[k];
        int cost = y[k];
        int time = m[k];
        if(j-y[k]>=0)chmin(dp[i][j], dp[from][j-cost] + time);
      }
    }
  }
  if(dp[n-1][c] < inf)cout << dp[n-1][c] << endl;
  else cout << -1 << endl;
	return 0;
}