#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
//#include <utility>
#include <set>
#include <iostream>
//#include <memory>
#include <string>
#include <vector>
#include <algorithm>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
//#include <cctype>
#include <cstring>
//#include <ctime>
#include <iterator>
#include <bitset>
//#include <numeric>
//#include <list>
//#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
#define pos S.S
#define cost S.F
#define time F
int dp[55][333];
void mainmain(){
	int n;
	int c;
	int m;
	cin>>n>>c>>m;
	VV(pii) vv;
	initvv(vv,n,n,mkp(INF,INF));
	string tt;
	stringstream ss1,ss2,ss3,ss4;
	getline(cin,tt);
	getline(cin,tt);
	ss1<<tt;
	getline(cin,tt);
	ss2<<tt;
	getline(cin,tt);
	ss3<<tt;
	getline(cin,tt);
	ss4<<tt;
	rep(i,m){
		int a,b,s,t;
		ss1>>a;
		ss2>>b;
		ss3>>s;
		ss4>>t;
		// cout<<a<<" "<<b<<endl;
		a--;
		b--;
		vv[a][b]=vv[b][a]=mkp(t,s);
	}
	// cout<<0<<endl;
	rep(i,55) rep(j,333) dp[i][j]=INF;

	priority_queue<pair<int,pii> > pq;
	pq.push(mkp(0,mkp(0,0)));
	// cout<<"hoge\n";
	while(!pq.empty()){
		auto top=pq.top();
		pq.pop();
		// cout<<-top.F<<" "<<-top.cost<<" "<<top.pos<<endl;
		if(dp[top.pos][-top.cost]!=INF) continue;
		dp[top.pos][-top.cost]=-top.F;
		rep(i,n){
			if(vv[top.pos][i].F!=INF){
				if(-top.cost+vv[top.pos][i].S>c) continue;
				if(dp[i][-top.cost+vv[top.pos][i].S]==INF){
					auto tmp=top;
					tmp.time-=vv[top.pos][i].F;
					tmp.cost-=vv[top.pos][i].S;
					tmp.pos=i;
					pq.push(tmp);
				}
			}
		}
	}
	int ans=INF;
	rep(i,c+1){
		ans=min(ans,dp[n-1][i]);
	}
	if(ans==INF) cout<<-1<<endl;
	else cout<<ans<<endl;
}



}
main() try{
    mainmain();
}
catch(...){
}