#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()){
    ll N,M,S; cin >> N >> M >> S;
    S = min(S,2500LL);
    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);
        
    }
    vector<pll> CD(N);
    for(int i = 0; i < N;i++){
        cin >> CD[i].first >> CD[i].second;
        CD[i].first = min(CD[i].first,2500LL);
    }
        
    vector<vector<ll>> dist(N,vector<ll>(2501,LINF));
    dist[0][S] = 0;
    
    using Item = tuple<ll,ll,ll>;
    priority_queue<Item,vector<Item>,greater<Item>> q; q.push(Item(0,0,S));
    while(q.size()){
        ll d,u,s; tie(d,u,s) = q.top(); q.pop();
        
        if(dist[u][s] != d) continue;
        ll C = CD[u].first;
        ll D = CD[u].second;
        
        // 留まって両替する場合
        {
            ll nextS = min(2500LL,s + C);
            if(dist[u][nextS] > dist[u][s] + D){
                dist[u][nextS] = dist[u][s] + D;
                q.push(Item(dist[u][nextS],u,nextS));
            }
        }
        // 移動する場合
        for(auto& e:G[u]){
            ll v = e.v;
            ll A = e.A;
            ll B = e.B;
            
            ll nextS = s - A;
            if(nextS < 0) continue;
            
            if(dist[v][nextS] > dist[u][s] + B){
                dist[v][nextS] = dist[u][s] + B;
                q.push(Item(dist[v][nextS],v,nextS));
            }
        }
    }
    
    for(int i = 1; i < N;i++){
        // cout << i << " : " << dist[i] << endl;
        cout << *min_element(dist[i].begin(),dist[i].end()) << 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;
}


Measured memory_bytes: 7284