#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

ll ll_gcd(ll a, ll b) {
    if (a < b) return ll_gcd(b, a);
    ll r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

struct edge {
    ll to;
    ll cost;
};

#define INF 1000000000000000
#define MAX_V 200000

using P = pair<ll, ll>;

int V;
vector<edge> G[MAX_V];
vector<ll>d(MAX_V);

void dijkstra(int s) {
    priority_queue<P, vector<P>, greater<P> > que;
    fill(d.begin(), d.end(), INF);
    d[s] = 0;
    que.push(P(0, s));

    while (!que.empty()) {
        P p = que.top();
        que.pop();
        ll 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.cost) {
                d[e.to] = d[v] + e.cost;
                que.push(P(d[e.to], e.to));
            }
        }
    }
}

int main() {
    ll n,m,s;
    cin >> n >> m >> s;
    V = n*2501;
    for (ll i = 0; i < m; i++) {
        ll a, b, c, d;
        cin >> a >> b >> c >> d;
        a--;
        b--;
        a *= 2501;
        b *= 2501;
        for (ll j = 0; j < 2501; j++) {
            if (c+j<2501) {
                edge e = { b + j,d };
                G[a + c + j].push_back(e);
            }
            if (c + j < 2501) {
                edge ee = { a + j,d };
                G[b + c + j].push_back(ee);
            }
        }
    }
    ll ni = 2500;
    for (ll i = 0; i < n; i++) {
        ll a, b;
        cin >> a >> b;
        for (ll j = 0; j < 2500; j++) {
            edge e = { min(i*2501+ni,i*2501+a+j),b };
            G[i*2501+j].push_back(e);
        }
    }
    dijkstra(min(s,ni));
    
    for (int i = 1; i < n; i++) {
        ll zans = 12345678901234567;
        for (int j = 0; j < 2501; j++) {
            if (d[i * 2501 + j] != INF)zans = min(d[i*2501+j], zans);
        }
        cout << zans << endl;
    }
}

Measured memory_bytes: 26120