#include <bits/stdc++.h>
using namespace std;


//TEMPLATE
#define pb                push_back
#define mp                make_pair
#define ll                long long
#define ld                long double
#define pii               pair <ll, ll>
#define piii              pair <pii, pii>
#define F                 first
#define S                 second

#define newline           printf("\n")
#define minusone          printf("-1\n")
#define zeroo             printf("0\n")
#define scl1(a)           scanf("%lld", &a)
#define scl2(a, b)        scanf("%lld %lld", &a, &b)
#define scl3(a, b, c)     scanf("%lld %lld %lld", &a, &b, &c)
#define prl1(a)           printf("%lld\n", a)
#define prl2(a, b)        printf("%lld %lld\n", a, b)
#define ssl1(s)           scanf(" %[^\n]", s)
#define scd1(a)           scanf("%lf", &a)
#define scd2(a, b)        scanf("%lf %lf", &a, &b)
#define prd(a)            printf("%lf\n", a)
#define prld(a)           printf("%Lf\n", a)
#define prcase(cs)        printf("Case %lld: ", cs)
#define cin1(a)           cin >> a
#define cin2(a, b)        cin >> a >> b
#define cin3(a, b, c)     cin >> a >> b >> c
#define cin4(a, b, c, d)  cin >> a >> b >> c >> d
#define cot1(a)           cout << a << "\n"
#define cot2(a, b)        cout << a << " " << b << "\n"
#define cot3(a, b, c)     cout << a << " " << b << " " << c << "\n"
#define cot4(a, b, c, d)  cout << a << " " << b << " " << c << " " << d << "\n"
#define cotline           cout << "\n"
#define cotminus          cout << "-1\n"
#define cot0              cout << "0\n"
#define cotyes            cout << "YES\n"
#define cotno             cout << "NO\n"
#define cotcase(cs)       cout << "Case " << cs << ": "

#define reversed(s)       reverse(s.begin(), s.end())
#define asort(s)          sort(s.begin(), s.end())
#define dsort(s)          sort(s.rbegin(), s.rend())
#define all(s)            s.begin(), s.end()
#define uniq(s)           s.resize(distance(s.begin(),unique(s.begin(), s.end())))
#define found(s, x)       (s.find(x) != s.end())

#define for0(i, n)        for (i = 0; i < n; i++)
#define for1(i, n)        for (i = 1; i <= n; i++)
#define fora(i, a, b)     for (i = a; i <= b; i++)
#define forb(i, b, a)     for (i = b; i >= a; i--)
#define fori(it, s)       for(auto it = s.begin(); it != s.end(); it++)

#define FR                ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ms(a, x)          memset(a, x, sizeof a)
#define bitcount(n)       __builtin_popcountll(n)

//#define pi              3.1415926536
#define pi                acos(-1)

const ll INF = LLONG_MAX;
const ll SZ = 50+5;
const ll mod = 1e9+7;


struct data1 {
    ll v, a, b;
};

struct data2 {
    ll c, d;
} cd[SZ];

const ll safe = 2500;
ll n, m, s;
vector <data1> adj[SZ];
ll dis[SZ][2505];
ll mn[SZ];

void solve() {
    priority_queue <piii, vector <piii>, greater<piii> > pq;
    (s >= safe) ? pq.push({ {0, 1}, {1, safe}}) : pq.push({ {0, 0}, {1, s}});

    ll i, j;
    for1(i, n) {
        fora(j, 0, safe) dis[i][j] = INF;
    }
    dis[1][0] = 0;

    while(!pq.empty()) {
        piii p = pq.top();
        pq.pop();
        ll tt = p.F.F;
        ll st = p.F.S;
        ll u = p.S.F;
        ll c = p.S.S;

        if(st == 0) {
            ll cc = min(safe, c+cd[u].c);
            if(dis[u][cc] > tt+cd[u].d) {
                dis[u][cc] = tt+cd[u].d;
                (cc == safe) ? pq.push({ {tt+cd[u].d, 1}, {u, cc} }) : pq.push({ {tt+cd[u].d, 0}, {u, cc} });
            }
        }

        for(auto v: adj[u]) {
            data1 dt = v;
            ll t = tt + dt.b;
            ll rc = c - dt.a;

            if(rc >= 0) {
                if(dis[dt.v][rc] > t) {
                    dis[dt.v][rc] = t;
                    pq.push({ {t, st}, {dt.v, rc} });
                }
            }
        }
    }
}

int main() {
    ll cs = 0, tc = 1, x, y, z, i, j, k, g, p, q, ans = 0, sum = 0, c = 0, t = 0;
    //    ll a, b, d;
    string s1, s2;

    cin3(n, m, s);

    for1(i, m) {
        cin4(x, y, p, q);
        adj[x].pb({y, p, q});
        adj[y].pb({x, p, q});
    }

    for1(i, n) cin2(cd[i].c, cd[i].d);

    solve();

    fora(i, 2, n) {
        mn[i] = INF;
        fora(j, 0, safe) mn[i] = min(mn[i], dis[i][j]);
    }

    fora(i, 2, n) cot1(mn[i]);

    return 0;
}



Measured memory_bytes: 8292