#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 <type_traits>
#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 ISS = istringstream;
using OSS = ostringstream;
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; }

void in_impl(){};
template < typename T, typename... TS > void in_impl( T &head, TS &... tail ){ cin >> head; in_impl( tail ... ); }
#define IN( T, ... ) T __VA_ARGS__; in_impl( __VA_ARGS__ );

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 NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#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, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )

#define SZ( v ) ( (int)( v ).size() )
#define EXISTS( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

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

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

constexpr auto INF = LIM< LL >::max() / 2;

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	using Edge = tuple< int, int, int >;

	IN( int, N, M, S );
	chmin( S, 8000 );
	VVT< Edge > G( N );
	REP( M )
	{
		IN( int, u, v, a, b );
		--u, --v;
		G[u].EB( v, a, b );
		G[v].EB( u, a, b );
	}
	VI C( N ), D( N );
	REP( i, N )
	{
		cin >> C[i] >> D[i];
	}

	using State = tuple< LL, int, int >;
	// ( time, vertex, # of silvers )

	static LL distances[ 64 ][ 8192 ];
	fill( AALL( distances ), INF );
	distances[0][S] = 0;

	priority_queue< State, VT< State >, greater< State > > que;
	que.EM( 0, 0, S );

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

		if ( distances[u][s] < t )
		{
			continue;
		}

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

			if ( a <= s && chmin( distances[v][ s - a ], distances[u][s] + b ) )
			{
				que.EM( distances[v][ s - a ], v, s - a );
			}
		}

		const int ns = min( 8000, s + C[u]  );
		if ( chmin( distances[u][ ns ], distances[u][s] + D[u] ) )
		{
			que.EM( distances[u][ ns ], u, s + C[u] );
		}
	}

	REP( i, 1, N )
	{
		cout << *min_element( ALL( distances[i] ) ) << '\n';
	}
	cout << flush;

	return 0;
}

Measured memory_bytes: 11444