#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std; using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };

#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) ( c ).begin(), ( c ).end()
#define AALL( a, t ) ( t* )a, ( t* )a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + p, ( c ).end()

#define SZ( v ) ( (int)( v ).size() )
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

constexpr int INF = LIM<>::max();

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );

	int N, C, M;
	cin >> N >> C >> M;

	VI us( M ), vs( M ), cs( M ), ts( M );
	cin >> us >> vs >> cs >> ts;
	{
		auto f = bind( minus< int >(), _1, 1 );
		transform( ALL( us ), us.begin(), f );
		transform( ALL( vs ), vs.begin(), f );
	}

	using Edge = tuple< int, int, int >;
	VVT< Edge > G( N );
	REP( i, M )
	{
		G[ us[i] ].EB( vs[i], cs[i], ts[i] );
// 		G[ vs[i] ].EB( us[i], cs[i], ts[i] );
	}

	VVI distances( N, VI( C + 1, INF ) );
	distances[0][0] = 0;

	using State = Edge;
	priority_queue< State, VT< State >, greater< State > > que;
	que.EM( 0, 0, 0 );

	while ( !que.empty() )
	{
		const int dist = get< 0 >( que.top() );
		const int u = get< 1 >( que.top() );
		const int cost = get< 2 >( que.top() );
		que.pop();

		if ( distances[ u ][ cost ] < dist )
		{
			continue;
		}

		FOR( e, G[u] )
		{
			const int v = get< 0 >( e );
			const int c = get< 1 >( e );
			const int d = get< 2 >( e );

			if ( cost + c <= C && dist + d < distances[v][ cost + c ] )
			{
				que.EM( distances[v][ cost + c ] = dist + d, v, cost + c );
			}
		}
	}

	const int res = *min_element( ALL( distances.back() ) );
	cout << ( res == INF ? -1 : res ) << endl;

	return 0;
}