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

const int nm = 50, am = 50;
int n, m, s, r;
long long ans[nm], reach[nm][(nm - 1) * am + 1];
bool visited[nm];

struct Edge {
	int opp;
	int cost;
	int time;
	Edge(int o, int c, int t) :
			opp(o), cost(c), time(t) {
	}
};
vector<Edge> g[nm];

struct State {
	long long time;
	int num;
	int coin;
	State(long long t, int n, int c) :
			time(t), num(n), coin(c) {
	}
};
auto comp = [](State &a, State &b) {
	return a.time > b.time;
};

priority_queue<State, vector<State>, decltype(comp)> q(comp);

int main() {
	cin >> n >> m >> s;
	fill(reach[0], reach[n], LLONG_MAX);
	s = min(s, (nm - 1) * am);
	r = n - 1;
	for (int i = 0, u, v, a, b; i < m; i++) {
		cin >> u >> v >> a >> b;
		u--, v--;
		g[u].emplace_back(v, a, b);
		g[v].emplace_back(u, a, b);
	}
	for (int i = 0, c, d; i < n; i++) {
		cin >> c >> d;
		g[i].emplace_back(i, -c, d);
	}
	visited[0] = 1;
	for (int i = 0; i <= s; i++)
		reach[0][i] = 0;
	q.emplace(0, 0, s);
	while (1) {
		long long t = q.top().time;
		int v = q.top().num;
		int c = q.top().coin;
		q.pop();
		if (!visited[v]) {
			visited[v] = 1;
			ans[v] = t;
			if (!--r)
				break;
		}
		for (Edge &e : g[v]) {
			if (e.cost > c)
				continue;
			long long nt = t + e.time;
			int nv = e.opp;
			int nc = min(c - e.cost, (nm - 1) * am);
			if (nt < reach[nv][nc]) {
				for (int i = 0; i <= nc; i++)
					reach[nv][i] = min(reach[nv][i], nt);
				q.emplace(nt, nv, nc);
			}
		}

	}
	for (int i = 1; i < n; i++)
		cout << ans[i] << endl;

}
