#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

struct edge{
    ll u,v;
    ll A,B;
    edge(){};
    edge(int u,int v,int A,int B):u(u),v(v),A(A),B(B){}
};
template<class Type>
Type solve(Type res = Type()){
    int N,M,S; cin >> N >> M >> S;
    
    auto pllplus = [](const pll& l,const pll& r){
        return pll(l.first+r.first,l.second+r.second);
    };
    // saitan syouhiS
    vector<vector<pll>> DIST(N,vector<pll>(N,pll(LINF,LINF)));
    for(int i = 0; i < N;i++) DIST[i][i] = pll(0,0);
    
    vector<vector<edge>> G(N);
    for(int i = 0; i < M;i++){
        int u,v,A,B; cin >> u >> v >> A >> B;
        u--; v--;
        G[u].emplace_back(u,v,A,B);
        G[v].emplace_back(v,u,A,B);
        
        DIST[u][v] = pll(B,A);
        DIST[v][u] = pll(B,A);
    }
    vector<pll> CD(N);
    for(int i = 0; i < N;i++){
        cin >> CD[i].first >> CD[i].second;
    }
    
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++){
            for(int k = 0; k < N;k++){
                DIST[j][k] = min(DIST[j][k],pllplus(DIST[j][i],DIST[i][k]));
            }
        }
    }
    
    // 最小時間で街tへ行くための　時間とその時の費用
    vector<pll> dist(N,pll(LINF,LINF));
    dist[0] = pll(0,-S);
    for(int i = 0; i < 500; i++){
        for(int u = 0; u < N; u++){
            if(dist[u].first == LINF) continue;
            
            for(int v = 0; v < N; v++){
                if(u == v) continue;
                
                ll dtime = dist[u].first;
                ll leftS = -dist[u].second;
                
//                ll needS = DIST[u][v].first;
//                ll needT = DIST[u][v].second;
                
                ll needS = DIST[u][v].second;
                ll needT = DIST[u][v].first;
                
//                cout << " ----" << endl;
//                cout << u << " -> " << v << endl;
//                cout << dtime << " " << leftS << endl;
//                cout << needT << " " << needS << endl;
                if(needS > leftS){
                    ll DiffS = needS - leftS;
                    
                    ll cntchange = (DiffS+CD[u].first-1)/CD[u].first;
                    
                    ll getC = cntchange*CD[u].first;
                    ll addT = cntchange*CD[u].second;
                    
                    leftS += getC;
                    needT += addT;
                }
                
                ll nextT = needT + dtime;
                ll nextS = leftS - needS;
                
                pll nextState = pll(nextT,-nextS);
                // cout << nextState << endl;
                
                if(dist[v] > nextState){
                    dist[v] = nextState;
                }
            }
        }
//        cout << " **** " << endl;
//        cout << dist << endl;
//        cout << " **** " << endl;
    }
    for(int i = 1; i < N;i++){
        cout << dist[i].first << endl;
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    solve(0);
    // cout << fixed << setprecision(15) << solve<ll>() << endl;
    return 0;
}
