#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint operator^(const ll& t)const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}
	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

///////////////////////////

struct dijksra {

	ll N;
	vector<vector<edge>> g;
	ll s;

	vector<ll> ans;

	dijksra(ll N0, ll s, vector<vector<edge>> g0) {//頂点数、始点、グラフ(頂点は1indexか0index)
		N = N0;
		g = g0;

		ans.assign(N + 1, INF);


		priority_queue<pair<ll, ll>> q;//(-キョリ、頂点)

		ans[s] = 0;
		q.push({ 0,s });

		while (!q.empty()) {
			auto x = q.top();
			q.pop();

			ll dis = -x.first;
			ll v = x.second;

			if (dis > ans[v]) { continue; }


			for (edge e : g[v]) {
				ll w = e.to;
				if (dis + e.d < ans[w]) {
					ans[w] = dis + e.d;
					q.push({ -ans[w], w });
				}
			}


		}
	}

	ll d(ll t) {//sからtまでの最短距離を出力
		return ans[t];
	}


};


ll t(ll x, ll y) {
	return 5000 * (x - 1) + y + 1;
}


int main() {
	
	ll N, M, S;
	cin >> N >> M >> S;

	ll L = 5000 * N;
	vector<vector<edge>> g(L + 1);

	repn(i, M) {
		ll u, v, a, b;
		cin >> u >> v >> a >> b;

		rep(j, 5000) {
			if (j < a) { continue; }
			g[t(u, j)].push_back({ i,t(u,j),t(v,j - a),b });
			g[t(v, j)].push_back({ i,t(v,j),t(u,j - a),b });
		}

	}

	repn(i, N) {
		ll c, d;
		cin >> c >> d;
		rep(j, 5000) {
			ll k = min(j + c, 4999);
			g[t(i, j)].push_back({ i,t(i,j),t(i,k),d });
		}
	}

	S = min(S, 4999);

	dijksra dij(L, t(1,S), g);

	for (ll i = 2; i <= N; i++) {
		ll ans = INF;
		rep(j, 5000) {
			ans = min(ans, dij.ans[t(i, j)]);
			
		}
		cout << ans << endl;
	}


	
	


	system("PAUSE");
}


Measured memory_bytes: 166456