/*
Author : N_o_o_B
Created : April 26 2020 18:45:47 
*/
#include <bits/stdc++.h>
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
#define TRACE
#ifdef TRACE
#define trace(...) { cerr<<"[ "; __trace__(#__VA_ARGS__, __VA_ARGS__);}
#undef endl
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const pair<Arg1,Arg2> &x) {
    return out<<"("<<x.first<<","<<x.second<<")";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const vector<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1>
ostream& operator << (ostream& out, const set<Arg1> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1,typename Arg2>
ostream& operator << (ostream& out, const map<Arg1,Arg2> &a) {
    out<<"[";for(const auto &x:a)out<<x<<",";return out<<"]";
}
 
template <typename Arg1>
void __trace__(const string name, Arg1&& arg1){
    cerr << name << " : " << arg1 << " ] " << endl;
}
 
template <typename Arg1, typename... Args>
void __trace__(const string names, Arg1&& arg1, Args&&... args){
    const string name = names.substr(0,names.find(','));
    cerr<<name<<" : "<<arg1<<" | ";
    __trace__(names.substr(1+(int)name.size()), args...);
}
#else
    #define trace(args...)
#endif
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vii;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<pair<ll,ll>> vll;
typedef vector<vl> vvl;
//typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> oset;
#define fori(i,n) for(int i=0;i<n;i++)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define repd(i,a,b) for(int i=a;i>=b;i--)
#define ford(i,n)  for(int i=n-1;i>=0;i--)
#define trav(x,a) for(auto& x:a)
#define all(x) x.begin(),x.end()
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define fi first
#define se second
clock_t time_p=clock();
void time_taken()
{
    time_p=clock()-time_p;
    cerr<<"Time Taken : "<<(float)(time_p)/CLOCKS_PER_SEC<<"\n";
}
//const ll mod=998244353;
const ll mod=1e9+7;
const ll INF=1e18;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    cout.precision(12);cout << fixed;

    int n,m,s;
    cin >> n >> m >> s;
    s = min(s,5005);

    vector<tuple<int,int,int>> adj[n];

    while(m--){
        int u,v,a,b;
        cin >> u >> v >> a >> b;
        u--;v--;
        adj[u].emplace_back(v,a,b);
        adj[v].emplace_back(u,a,b);
    }

    vi c(n),d(n);
    fori(i,n){
        cin >> c[i] >> d[i];
    }

    priority_queue<pair<ll, pair<ll,ll>>, vector<pair<ll, pair<ll,ll>>>, greater<pair<ll, pair<ll,ll>>>> q;
    vector<vector<ll>> dis(50,vl(5010,INF));
    q.push({0, {0,s}});
    dis[0][s] = 0;
    while (q.size())
    {
        auto p = q.top();
        q.pop();
        ll u = p.second.first;
        ll s = p.second.second;
        if (p.first > dis[u][s])
            continue;

        if(s+c[u]<=5005){
            if(dis[u][s+c[u]] > p.first + d[u]){
                dis[u][s+c[u]] = p.fi + d[u];
                q.push({dis[u][s+c[u]],{u,s+c[u]}});
            }
        }
        
        for (auto v : adj[u])
        {
            int to = get<0>(v);
            int req = get<1>(v);
            int wt = get<2>(v);
            if(s<req) continue; 
            if(dis[to][s-req] > p.fi + wt){
                dis[to][s - req] = p.fi + wt;
                q.push({dis[to][s-req],{to,s-req}});
            }
        }
    }

    rep(i,1,n-1){
        ll ans = INF;
        fori(j,5006){
            ans = min(ans,dis[i][j]);
        }
        cout << ans << endl;
    }

    time_taken();
    return 0;
}

Measured memory_bytes: 11564