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

// template {{{
#define  range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

// constexpr i32 mod   = 998244353;
constexpr i32 mod   = 1e9 + 7;
constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1};
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(int x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; }
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

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

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// }}}

void solver() {
    int N = input(), M = input(), S = input();

    struct edge {
        int to, a, b;

        edge() {}
        edge(int to, int a, int b) : to(to), a(a), b(b) {}
    };

    auto G = make_vector(N, 0, edge());

    range(i, 0, M) {
        int u = input() - 1, v = input() - 1;
        int a, b;
        cin >> a >> b;

        G[u].push_back(edge(v, a, b));
        G[v].push_back(edge(u, a, b));
    }

    vector< int > c(N), d(N);
    range(i, 0, N) cin >> c[i] >> d[i];

    int MAX_C = 50 * 100;
    S = min(S, MAX_C);

    auto dist = make_vector(N, MAX_C + 1, infll);
    dist[0][S] = 0;

    using P = pair<i64, pair<int, int>>;
    priority_queue<P, vector<P>, greater<P>> pq;
    pq.emplace(0, make_pair(0, S));

    while (!pq.empty()) {
        auto uku = pq.top();
        pq.pop();

        i64 t;
        pair< int, int > p;
        tie(t, p) = uku;

        int v, m;
        tie(v, m) = p;

        if (dist[v][m] < t) continue;

        if (dist[v][min(m + c[v], MAX_C)] > dist[v][m] + d[v]) {
            dist[v][min(m + c[v], MAX_C)] = dist[v][m] + d[v];
            pq.emplace(dist[v][min(m + c[v], MAX_C)], make_pair(v, min(m + c[v], MAX_C)));
        }

        for (auto u: G[v]) {
            if (m - u.a < 0) continue;

            if (dist[u.to][m - u.a] > dist[v][m] + u.b) {
                dist[u.to][m - u.a] = dist[v][m] + u.b;
                pq.emplace(dist[u.to][m - u.a], make_pair(u.to, m - u.a));
            }
        }
    }


    range(t, 1, N) {
        i64 ans = infll;
        range(i, 0, MAX_C + 1) {
            chmin(ans, dist[t][i]);
        }
        cout << ans << endl;
    }

}

signed main(int argc, char *argv[]) {
    solver();
}


Measured memory_bytes: 9268