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

#define LL long long
typedef pair<int, int> pii;

template< typename T > inline void read(T &x)
{
    static char _c;
    static bool _f;

    x = 0;
    _f = 0;
    _c = getchar();

    while(_c < '0' || '9' < _c) {if(_c == '-') _f = true; _c = getchar();}
    while('0' <= _c && _c <= '9') {x = (x << 1) + (x << 3) + (_c & 15); _c = getchar();}
    if(_f) x = -x;
}
template < typename T, typename ...Args > inline void read(T &x, Args &...args) {read(x); read(args...);}

template < typename T > inline void Min(T &x, T y) {if(y < x) x = y;}
template < typename T > inline void Max(T &x, T y) {if(x < y) x = y;}


#define lowbit(x) ((x) & -(x))
#define lson l,mid,id<<1
#define rson mid+1,r,id<<1|1
#define ls id<<1
#define rs id<<1|1
#define MID(l,r) ((l)+(((r)-(l))>>1))
#define fi first
#define se second
#define mk make_pair
#define mt make_tuple
#define pb push_back

const int INF = 0x3f3f3f3f;
const LL LINF = 0x3f3f3f3f3f3f3f3f;
const double pi = (double) acos(-1.0);
const double eps = (double) 1e-8;
const int e5 = (int) 1e5 + 5;
const int MOD = (int) 1e9 + 7;
//const int MOD = (int) 998244353;
//int MOD = 998244353;

template< typename T0, typename T1 > inline void depair(T0 &x, T1 &y, pair<T0, T1> &p) {x = p.fi, y = p.se;}
inline int sig(double x) {return x < -eps ? -1 : eps < x;}
LL fp(LL a, LL n, LL mod = MOD)
{
    if(n < 0) a = fp(a, mod - 2, mod), n = -n;
    LL res = 1; for(; n; n >>= 1, a = a * a % mod) if(n & 1) res = res * a % mod; return res;
}

struct Mint
{
    int x;
    Mint() {x = 0;}
    Mint(int _x): x(_x) {if(x < 0 || x >= MOD) x = (x % MOD + MOD) % MOD;}
    Mint(LL _x): x(_x) {if(x < 0 || x >= MOD) x = (x % MOD + MOD) % MOD;}
    Mint operator - () const{
        return Mint(MOD - x);
    }
    Mint operator + (const Mint &rhs) const{
        return Mint(x + rhs.x >= MOD ? x + rhs.x - MOD : x + rhs.x);
    }
    Mint operator - (const Mint &rhs) const{
        return Mint(x - rhs.x < 0 ? x - rhs.x + MOD : x - rhs.x);
    }
    Mint operator * (const Mint &rhs) const{
        return Mint((LL)x * rhs.x % MOD);
    }
    Mint operator / (const Mint &rhs) const{
        return Mint(x * fp(rhs.x, -1) % MOD);
    }
    Mint& operator += (const Mint &rhs) {
        x += rhs.x; if(x >= MOD) x -= MOD; return *this;
    }
    Mint& operator *= (const Mint &rhs) {
        x = ((LL)x * rhs.x) % MOD; return *this;
    }
    bool operator == (const Mint &rhs) const{
        return x == rhs.x;
    }
    bool operator != (const Mint &rhs) const{
        return x != rhs.x;
    }
    friend ostream& operator << (ostream &out, const Mint &rhs){
        return out << rhs.x;
    }
    friend istream& operator >> (istream &in, Mint &rhs){
        return in >> rhs.x;
    }
};


const int maxn = (int) 2e5 + 20;
const int maxm = (int) 1e6 + 20;


int n, m, s;
int tot;
vector<tuple<int, int, int> > G[55];
int c[55], d[55];
LL dp[51][5005];
bool inq[51][5005];

void work()
{
    cin >>n >>m >>s;

    tot = 0;
    for(int i = 0; i < m; i++)
    {
        int x, y, a, b;
        cin >>x >>y >>a >>b;
        G[x].pb(mt(y, a, b));
        G[y].pb(mt(x, a, b));

        tot += a;
    }

    for(int i = 1; i <= n; i++) cin >>c[i] >>d[i];

    s = min(s, tot);

    for(int i = 1; i <= n; i++)
        for(int j = 0; j <= tot; j++)
            dp[i][j] = LINF;

    dp[1][s] = 0;
    deque<pair<int, int> > Q;
    Q.push_back(mk(1, s));
    inq[1][s] = 1;

    while(!Q.empty())
    {
        int u = Q.front().fi;
        int x = Q.front().se;
        Q.pop_front();
        inq[u][x] = 0;

        for(auto tp : G[u])
        {
            int v, a, b;
            tie(v, a, b) = tp;

            if(a > x) continue;

            if(dp[v][x - a] > dp[u][x] + b)
            {
                dp[v][x - a] = dp[u][x] + b;
                if(!inq[v][x - a])
                {
                    Q.push_front(mk(v, x - a));
                    inq[v][x - a] = 1;
                }
            }
        }

        int y = min(tot, x + c[u]);
        if(dp[u][y] > dp[u][x] + d[u])
        {
            dp[u][y] = dp[u][x] + d[u];
            if(!inq[u][y])
            {
                Q.push_back(mk(u, y));
                inq[u][y] = 1;
            }
        }
    }

    for(int i = 2; i <= n; i++)
    {
        LL ans = LINF;
        for(int j = 0; j <= tot; j++)
            ans = min(ans, dp[i][j]);
        cout <<ans <<endl;
    }

}

int main(int argc, char **argv)
{
#ifdef yukihana0416
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif // yukihana0416
//    get_prime();
//    pre();
    int tc = 1;
//    read(tc);
    for(int ca = 1; ca <= tc; ca++)
    {
//        printf("Case #%d: ", ca);
        work();
    }
    return 0;
}


Measured memory_bytes: 5156