// writer: w33z8kqrqk8zzzx33
#include <bits/stdc++.h>
using namespace std;

// begin fast read template by CYJian (source: https://www.luogu.com.cn/paste/i11c3ppx)

namespace io {
	const int __SIZE = (1 << 21) + 1;
	char ibuf[__SIZE], *iS, *iT, obuf[__SIZE], *oS = obuf, *oT = oS + __SIZE - 1, __c, qu[55]; int __f, qr, _eof;
	#define Gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, __SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	inline void flush () { fwrite (obuf, 1, oS - obuf, stdout), oS = obuf; }
	inline void gc (char &x) { x = Gc(); }
	inline void pc (char x) { *oS ++ = x; if (oS == oT) flush (); }
	inline void pstr (const char *s) { int __len = strlen(s); for (__f = 0; __f < __len; ++__f) pc (s[__f]); }
	inline void gstr (char *s) { for(__c = Gc(); __c < 32 || __c > 126 || __c == ' ';)  __c = Gc();
		for(; __c > 31 && __c < 127 && __c != ' '; ++s, __c = Gc()) *s = __c; *s = 0; }
	template <class I> inline bool gi (I &x) { _eof = 0;
		for (__f = 1, __c = Gc(); (__c < '0' || __c > '9') && !_eof; __c = Gc()) { if (__c == '-') __f = -1; _eof |= __c == EOF; }
		for (x = 0; __c <= '9' && __c >= '0' && !_eof; __c = Gc()) x = x * 10 + (__c & 15), _eof |= __c == EOF; x *= __f; return !_eof; }
	template <class I> inline void print (I x) { if (!x) pc ('0'); if (x < 0) pc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10; while (qr) pc (qu[qr --]); }
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
} using io::pc; using io::gc; using io::pstr; using io::gstr; using io::gi; using io::print;

// end fast read template by CYJian

#define iter(i, a, b) for(int i=(a); i<(b); i++)
#define rep(i, a) iter(i, 0, a)
#define rep1(i, a) iter(i, 1, (a)+1)
#define log(a) cerr<<"\033[32m[DEBUG] "<<#a<<'='<<(a)<<" @ line "<<__LINE__<<"\033[0m"<<endl
#define all(a) a.begin(), a.end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
 
using ll=long long;
using pii=pair<int, int>;
//#define int ll
const int MOD = 1000000007;

struct ed {
	int dest, cost;
	ll time;
	const bool operator<(const ed o) const {
		return time > o.time;
	}
};
vector<ed> el[51];
ll c[51], d[51];
ll spath[51][5002]; // 0 ~ 5000: amount of money; 5001: infinite money
priority_queue<ed> pq;

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    int N, M, S; gi(N), gi(M), gi(S);
	if(S >= 5001) S = 5001;
	memset(spath, 0x3f, sizeof spath);
	spath[1][S] = 0;
	rep(i, M) {
		int u, v, a; ll b;
		gi(u), gi(v), gi(a), gi(b);
		el[u].pb({v, a, b});
		el[v].pb({u, a, b});
	}
	rep1(i, N) gi(c[i]), gi(d[i]);
	pq.push({1, S, 0});
	while(!pq.empty()) {
		ed at = pq.top(); pq.pop();
		int loc = at.dest, silv = at.cost; ll t = at.time;
		if(silv != 5001) {
			ll t2 = t + d[loc];
			int s2 = silv + c[loc];
			if(s2 >= 5001) s2 = 5001;
			if(spath[loc][s2] > t2) {
				spath[loc][s2] = t2;
				pq.push({loc, s2, t2});
			}
		}
		for(auto& e:el[loc]) {
			if(e.cost > silv) continue;
			ll t2 = t + e.time;
			int s2 = (silv == 5001) ? 5001 : (silv - e.cost);
			if(spath[e.dest][s2] > t2) {
				spath[e.dest][s2] = t2;
				pq.push({e.dest, s2, t2});
			}
		}
	}
	iter(i, 2, N+1) {
		rep(c, 5002) spath[i][0] = min(spath[i][0], spath[i][c]);
		print(spath[i][0]);
		pc('\n');
	}
}


Measured memory_bytes: 9196