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

using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using uint = unsigned int;
using ull = unsigned long long;

template<typename T> using uset = unordered_set<T>;
template<typename T1, typename T2> using umap = unordered_map<T1, T2>;

constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;

template<typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template<typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) { return (a > b && (a = b, true)); }
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) { return (a < b && (a = b, true)); }

template<typename T>
ostream& operator <<(ostream &os, vector<T> &v) {
	os << v[0];
	for (int i = 1; i < v.size(); i++) os << " " << v[i];
	return (os);
}

template<typename T>
istream& operator >>(istream &is, vector<T> &v) {
	for (auto &u : v) is >> u; return (is);
}

template<typename T1, typename T2>
istream& operator >>(istream &is, pair<T1, T2> &p) {
	return (is >> p.first >> p.second);
}

template<typename T>
struct Edge {
    int from, to;
    T cost;
    Edge () {}
    Edge (int from, int to, T cost) : from(from), to(to), cost(cost) {}
    Edge (int to, T cost) : from(-1), to(to), cost(cost) {}
};

template<typename T>
vector<T> Dijkstra(int V, const vector<vector<Edge<T>>> &G, int s) {
    using Node = pair<T, int>;
    constexpr T INF = numeric_limits<T>::max();
    vector<T> d(V, INF);
    priority_queue<Node, vector<Node>, greater<Node>> pq;

    d[s] = 0;
    pq.emplace(0, s);
    while (!pq.empty()) {
        Node node = pq.top(); pq.pop();
        if (d[node.second] < node.first) continue;
        for (auto &e : G[node.second]) {
            T cost = e.cost + node.first;
            if (cost < d[e.to]) {
                d[e.to] = cost;
                pq.emplace(cost, e.to);
            }
        }
    }

    return (d);
}

ll to_int(ll node, ll silver) {
	return (node * 3000 + silver);
}

void Main() {
	ll N, M, S; cin >> N >> M >> S;
	vector<vector<Edge<ll>>> G(N*3000);
	while (M--) {
		ll u, v, a, b; cin >> u >> v >> a >> b;
		--u, --v;
		for (int j = a; j < 3000; j++) {
			G[to_int(u, j)].emplace_back(to_int(v, j-a), b);
			G[to_int(v, j)].emplace_back(to_int(u, j-a), b);
		}
	}
	//万能な銀貨の数を2999にしておくとよさそう
	for (ll i = 0; i < N; i++) {
		ll C, D;
		cin >> C >> D;
		for (ll j = 0; j < 3000; j++) {
			G[to_int(i, j)].emplace_back(to_int(i, min(2999ll, j+C)), D);
		}
	}
	vll ans = Dijkstra((int)N*3000, G, (int)min(S, 2999ll));
	for (ll i = 1; i < N; i++) {
		ll minv = LLINF;
		for (ll j = 0; j < 3000; j++) {
			chmin(minv, ans[to_int(i, j)]);
		}
		cout << minv << endl;
	}
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout << fixed << setprecision(20);
	Main();
	return (0);
}


Measured memory_bytes: 27572