#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

const int N = 55;
using P = pair<int, pii>;
vector<vector<P>> G(N);

signed main() {
    fio();
    ll n, m, s;
    cin >> n >> m >> s;
    const int S = 2500;
    s = min(s, S);

    rep (i, m) {
        ll u, v, a, b;
        cin >> u >> v >> a >> b;
        u--; v--;
        G[u].push_back(P(b, pii(v, a)));
        G[v].push_back(P(b, pii(u, a)));
    }

    vl c(n), d(n);
    rep (i, n) cin >> c[i] >> d[i];

    vll dist(n, vl(S + 1, INF));
    dist[0][s] = 0;

    priority_queue<P, vector<P>, greater<P>> pq;
    pq.push(P(0, pll(0, s)));
    while (pq.size() > 0) {
        P temp = pq.top();
        pq.pop();

        int u = temp.second.first;
        int gin = temp.second.second;
        ll cost = temp.first;

        if (dist[u][gin] < cost) continue;
        
        if (gin != S) {
            int ngin = min(S, gin + c[u]);
            ll ncost = cost + d[u];
            if (dist[u][ngin] > ncost) {
                dist[u][ngin] = ncost;
                pq.push(P(ncost, pll(u, ngin)));
            }
        }

        rep (i, G[u].size()) {
            ll hun = G[u][i].first;
            int v = G[u][i].second.first;
            ll gi = G[u][i].second.second;

            ll ncost = cost + hun;
            ll ngin = gin - gi;
            if (ngin < 0) continue;

            if (dist[v][ngin] > ncost) {
                dist[v][ngin] = ncost;
                pq.push(P(ncost, pll(v, ngin)));
            }
        }
    }
    // DEBUG_MAT(dist);

    rep1 (v, n - 1) {
        ll mi = INF;
        for (int s = 0; s <= S; s++) {
            chmin(mi, dist[v][s]);
        }
        cout << mi << endl;
    }
}

Measured memory_bytes: 7276