#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#include <limits>
#include <cassert>

using namespace std;

/* template */

using ll = long long;

void debug_out() { std::cout << std::endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << H << " ";
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cout << "debug: "; debug_out(__VA_ARGS__)
#else
#define debug(...) 
#endif

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i< (long long)(n); i++)
#define RRep(i, a, n) for (long long i = ((long long)(n-1ll)); i>=(long long)(a); i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

struct Edge{
    int to;
    ll weight;
    Edge(int t, ll w) : to(t), weight(w){ }
};

struct edge{
    int from;
    int to;
    ll weight;
    edge(int f,int t,ll w) : from(f), to(t), weight(w){ }
};


using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;

template <class T>
inline bool chmin(T &a, T b){
    if (a > b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b){
    if (a < b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
T lcm(T a, T b){
    return (a*b)/gcd(a,b);
}

bool isPalindrome(string s){
    string t = s;
    reverse(all(t));
    return s==t;
}

constexpr ll LNF = __LONG_LONG_MAX__;

constexpr int INF = 1e9+7;

vector<int> dx = {-1,0,1,0,-1,1,-1,1};
vector<int> dy = {0,-1,0,1,1,-1,-1,1};

/* template */

vector<ll> dijkstra(int s,int n,Graph g){
    typedef pair<ll,ll> P;
    vector<ll> d(n,LNF);
    priority_queue<P, vector<P>, greater<P>> que;
    d[s] = 0;
    que.push(P(0, s));
    while(!que.empty()){
        P p = que.top();
        que.pop();
        int v = p.second;
        if(d[v]<p.first) continue;
        for(int i = 0; i<g[v].size(); i++){
            Edge e = g[v][i];
            if(d[e.to]>d[v]+e.weight){
                d[e.to] = d[v] + e.weight;
                que.push(P(d[e.to],e.to));
            }
        }
    }
    return d;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m; ll s; cin >> n >> m >> s;
    Graph g(n*3000);
    chmin(s,2999ll);
    rep(_,0,m){
        int u,v; ll a,b; cin >> u >> v >> a >> b;
        u--; v--;
        rep(i,a,3000){
            g[u+i*n].emplace_back(v+(i-a)*n,b);
            g[v+i*n].emplace_back(u+(i-a)*n,b);
        }
    }
    rep(i,0,n){
        ll c,d; cin >> c >> d;
        Rep(j,0,2999){
            g[i+j*n].emplace_back(i+min(j+c,2999ll)*n,d);
        }
    }
    vector<ll> d = dijkstra(s*n,n*3000,g);
    rep(i,1,n){
        ll ans = LNF;
        rep(j,0,3000){
            chmin(ans,d[i+j*n]);
        }
        cout << ans << endl;
    }
}

Measured memory_bytes: 44664