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

// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;

/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto&& i : n)

/* debug */
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
// using D = double;
// using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
// const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; cin >> x; return x;}
inline ll IN() {ll x; cin >> x; return x;}
inline vs split(const string& t, char c) {vs v; stringstream s(t); string b; while(getline(s, b, c)) v.eb(b); return v;}
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
template <typename T, typename S> inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << endl;}
template <typename T> inline void print(const T& x) {cout << x << endl;}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v) {for (auto&& p : v) print(p);}
template <typename T> inline void print(const vector<T>& v, string s = " ") {REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");}


ll a[101];
ll b[101];
ll c[51];
ll d[51];
ll u[101];
ll v[101];

int msilver = 2500;

struct edge {
    int to, cost;
};

int Vnum;
vector<edge> G[1000000];
ll dist[1000000];

void addedge(int st, int ed, ll co) {
  edge e;
  e.to = ed;
  e.cost = co;
  G[st].push_back(e);
}

void dijkstra(int s) {
    priority_queue<pii, vector<pii>, greater<pii> > que;
    fill(dist, dist + Vnum + 10, LINF);
    dist[s] = 0;
    que.push(pii(0, s));

    while (!que.empty()) {
        pii p = que.top();
        que.pop();
        int v = p.second;
        if (dist[v] < p.first) {
            continue;
        }
        for (int i = 0; i < G[v].size(); i++) {
            edge e = G[v][i];
            if (dist[e.to] > dist[v] + e.cost) {
                dist[e.to] = dist[v] + e.cost;
                que.push(pii(dist[e.to], e.to));
            }
        }
    }
}

void sidx2snumscnt(int idx, int& snum, int& scnt) {
    snum = idx / msilver;
    scnt = idx % msilver;
}

void snumscnt2sidx(int snum, int scnt, int& idx) {
    idx = snum*msilver + scnt;
}

signed main() {
    //my-code
    ll N, M, S; cin >> N >> M >> S;
    ll U,V,A,B,C,D;
    REP(i, M) {
        cin >> U >> V >> A >> B;
        a[i] = A; b[i] = B; u[i] = U; v[i] = V;
    }
    REPS(i, 1, N+1) {
        cin >> C >> D;
        c[i] = C; d[i] = D;
    }
    Vnum = msilver*(N+1);
    int snum, scnt, stidx, toidx;
    REPS(i, 1, N+1) REP(j, msilver-c[i]) {
        snumscnt2sidx(i, j, stidx);
        snumscnt2sidx(i, j+c[i], toidx);
        addedge(stidx, toidx, d[i]);
        // cout << stidx << " " << toidx << " " << d[i] << endl;
    }
    // print("----------");
    REP(i, M) REPS(j, a[i], msilver) {
        snumscnt2sidx(u[i], j, stidx);
        snumscnt2sidx(v[i], j-a[i], toidx);
        addedge(stidx, toidx, b[i]);
        // cout << stidx << " " << toidx << " " << b[i] << endl;
        snumscnt2sidx(v[i], j, stidx);
        snumscnt2sidx(u[i], j-a[i], toidx);
        addedge(stidx, toidx, b[i]);
        // cout << stidx << " " << toidx << " " << b[i] << endl;
    }
    // print("----------");
    snumscnt2sidx(1, min(S, (ll)(msilver-1)), stidx);
    // print(stidx);
    dijkstra(stidx);
    // print("----------");
    ll besttime;
    REPS(i, 2, N+1) {
        besttime = LINF;
        REP(j, msilver) {
            snumscnt2sidx(i, j, toidx);
            chmin(besttime, dist[toidx]);
            // cout << toidx << " " << dist[toidx] << endl;
        }
        cout << besttime << endl;
    }

    return 0;
}

// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々

Measured memory_bytes: 40092