#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <unordered_map>
// #include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define sz(a) int(a.size())
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MSC0(X) memset((X), '\0', sizeof((X)))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define eps 1e-6
#define chu(x)  if(DEBUG_Switch) cout<<"["<<#x<<" "<<(x)<<"]"<<endl
#define du3(a,b,c) scanf("%d %d %d",&(a),&(b),&(c))
#define du2(a,b) scanf("%d %d",&(a),&(b))
#define du1(a) scanf("%d",&(a));
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
ll powmod(ll a, ll b, ll MOD) { if (a == 0ll) {return 0ll;} a %= MOD; ll ans = 1; while (b) {if (b & 1) {ans = ans * a % MOD;} a = a * a % MOD; b >>= 1;} return ans;}
ll poww(ll a, ll b) { if (a == 0ll) {return 0ll;} ll ans = 1; while (b) {if (b & 1) {ans = ans * a ;} a = a * a ; b >>= 1;} return ans;}
void Pv(const vector<int> &V) {int Len = sz(V); for (int i = 0; i < Len; ++i) {printf("%d", V[i] ); if (i != Len - 1) {printf(" ");} else {printf("\n");}}}
void Pvl(const vector<ll> &V) {int Len = sz(V); for (int i = 0; i < Len; ++i) {printf("%lld", V[i] ); if (i != Len - 1) {printf(" ");} else {printf("\n");}}}
inline long long readll() {long long tmp = 0, fh = 1; char c = getchar(); while (c < '0' || c > '9') {if (c == '-') fh = -1; c = getchar();} while (c >= '0' && c <= '9') tmp = tmp * 10 + c - 48, c = getchar(); return tmp * fh;}
inline int readint() {int tmp = 0, fh = 1; char c = getchar(); while (c < '0' || c > '9') {if (c == '-') fh = -1; c = getchar();} while (c >= '0' && c <= '9') tmp = tmp * 10 + c - 48, c = getchar(); return tmp * fh;}
void pvarr_int(int *arr, int n, int strat = 1) {if (strat == 0) {n--;} repd(i, strat, n) {printf("%d%c", arr[i], i == n ? '\n' : ' ');}}
void pvarr_LL(ll *arr, int n, int strat = 1) {if (strat == 0) {n--;} repd(i, strat, n) {printf("%lld%c", arr[i], i == n ? '\n' : ' ');}}
const int maxn = 110;
const int inf = 0x3f3f3f3f;
/*** TEMPLATE CODE * * STARTS HERE ***/
#define DEBUG_Switch 0
ll dp[55][55 * 50];
struct edge
{
    ll id, t, val, rm;
    edge() {}
    edge(ll ff, ll tt, ll vv, ll rrm)
    {
        id = ff;
        t = tt;
        val = vv;
        rm = rrm;
    }
    bool operator < (const edge & bb) const
    {
        return val > bb.val;
    }
};
priority_queue<edge> q;
ll n;
ll m;
ll s;
ll a[maxn];
ll b[maxn];
ll c[maxn];
ll d[maxn];
std::vector<edge> E[maxn];
ll maxcost;
void dij()
{
    maxcost = n * 50;
    s = min(s, maxcost);
    repd(i, 1, n)
    {
        repd(j, 0, maxcost) {
            dp[i][j] = 1e18;
        }
    }
    dp[1][s] = 0;
    q.push(edge(0, 1, 0, s));
    edge temp;
    while (!q.empty())
    {
        temp = q.top();
        q.pop();
        for (auto &y : E[temp.t])
        {
            ll rm = temp.rm - a[y.id];
            ll cost = temp.val + b[y.id];
            int flag = 0;
            for (; rm <= maxcost; )
            {
                if (rm >= 0)
                {
                    if (dp[y.t][rm] > cost)
                    {
                        dp[y.t][rm] = cost;
                        q.push(edge(0, y.t, dp[y.t][rm], rm));
                    }
                }
                cost += d[temp.t];
                rm += c[temp.t];
                // if (rm > maxcost && !flag)
                // {
                //     flag = 1;
                //     rm = maxcost;
                // }
            }
        }
    }
}

int main()
{
#if DEBUG_Switch
    freopen("C:\\code\\input.txt", "r", stdin);
#endif
    //freopen("C:\\code\\output.txt","r",stdin);
    n = readint();
    m = readint();
    s = readint();
    int u, v;
    repd(i, 1, m)
    {
        u = readint();
        v = readint();
        a[i] = readint();
        b[i] = readint();
        E[v].pb(edge(i, u, 0, 0));
        E[u].pb(edge(i, v, 0, 0));
    }
    repd(i, 1, n)
    {
        c[i] = readint();
        d[i] = readint();
    }
    dij();
    repd(i, 2, n)
    {
        ll ans = 1e18;
        repd(j, 0, maxcost)
        {
            ans = min(ans, dp[i][j]);
        }
        printf("%lld\n", ans );
    }
    return 0;
}




Measured memory_bytes: 69960