#include "bits/stdc++.h"
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--)
#define all(a)  (a).begin(),(a).end()
#define IOS std::cin.tie(0),std::ios::sync_with_stdio(false)

namespace idaten {

	using namespace std;
	using ll = int_fast64_t;
	using ull = uint_fast64_t;
	using P = std::pair<int64_t, int64_t>;
	template<typename T1, typename T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; }
	template<typename T1, typename T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; }
	template<class Type>struct is_vector : std::false_type {};
	template<class ValueType, class Alloc>struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};
	template <typename T> inline std::ostream& operator << (std::ostream& out, const std::vector<T>& v) {
		if (v.empty())return out;
		constexpr bool is_vector_v = is_vector<T>::value;
		if (is_vector_v)for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? "\n" : "");
		else for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? " " : "");
		return out;
	}
	inline void put() {}
	template<class T> inline void put(const T& first) { std::cout << first << "\n"; }
	template<class T, class... N> inline void put(const T& first, const N& ... rest) { std::cout << first << " "; put(rest...); }
	inline void putn() {}
	template<class T, class... N> inline void putn(const T& first, const N& ... rest) { std::cout << first << "\n"; putn(rest...); }

	template<typename T>
	struct edge {
		int to;
		T cost;
		edge(int t, T c) {
			to = t;
			cost = c;
		}
	};
	ll ma = 2e4;
	ll ind(ll i, ll j) {
		return i * ma + j;
	}
	P vi(ll num) {
		return P(num / ma, num % ma);
	}

	template<typename T>
	void dijkstra(int s, vector<vector<edge<T>>>& path, vector<T>& d) {
		using pi = pair<T, int>;
		priority_queue<pi, vector<pi>, greater<pi>> q;
		q.push(P(0, s));
		d[s] = 0;
		while (!q.empty()) {
			P p = q.top();
			q.pop();
			int v = p.second;
			if (d[v] < p.first)continue;
			REP(i, path[v].size()) {
				edge<T> e = path[v][i];
				if (d[e.to] > d[v] + e.cost) {
					d[e.to] = d[v] + e.cost;
					q.push(P(d[e.to], e.to));
				}
			}
		}
		return;
	}
	void solve() {
		IOS;
		ll n, m, s;
		cin >> n >> m >> s;
		vector<ll> a(m), b(m), u(m), v(m), c(n), d(n);
		REP(i, m) {
			cin >> u[i] >> v[i] >> a[i] >> b[i];
			u[i]--;
			v[i]--;
		}
		REP(i, n) {
			cin >> c[i] >> d[i];
		}
		using e = edge<ll>;
		vector<vector<e>> path(n* ma);
		//ll ma = 10000;
		REP(i, m) {
			REP(j, ma) {
				ll from = ind(u[i], j);
				ll to = ind(v[i], j - a[i]);
				if (0 <= j - a[i] && j - a[i] < ma) {
					path[from].push_back(e(to, b[i]));
				}
				from = ind(v[i], j);
				to = ind(u[i], j - a[i]);
				if (0 <= j - a[i] && j - a[i] < ma) {
					path[from].push_back(e(to, b[i]));
				}

			}
		}
		REP(i, n) {
			REP(j, ma) {
				ll from = ind(i, j);
				ll to = ind(i, min<ll>(j + c[i], ma - 1));
				path[from].push_back(e(to, d[i]));
			}
		}
		vector<ll> dist(n * ma+1, LLONG_MAX/2);
		ll start = ind(0, min<ll>(ma - 1, s));
		dijkstra(start, path, dist);
		FOR(i, 1, n) {
			ll res = LLONG_MAX;
			REP(j, ma) {
				ll t = ind(i, j);
				chmin(res, dist[t]);
			}
			put(res);
		}
	}
} // namespace idaten

int main() {
	idaten::solve();
	return 0;
}


Measured memory_bytes: 159880