#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP1(i, n) for (ll i = 1; i <= (n); ++i)
#define FOR(i, a) for (auto &i : a)
#define CH(f, x, y) x = f(x, y)
#define IN(T, x) \
    T x;         \
    cin >> x;
#define AIN(T, a, n) \
    vector<T> a(n);  \
    FOR(i, a)        \
    cin >> i;
#define A2IN(T1, a, T2, b, n) \
    vector<T1> a(n);          \
    vector<T2> b(n);          \
    REP(i, n)                 \
    cin >> a[i] >> b[i];
#define OUT(x) cout << (x) << endl;
#define FOUT(x) cout << fixed << setprecision(15) << (x) << endl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
    SORT(a);     \
    reverse(ALL(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define DUMPA(a)          \
    cout << #a << " = {"; \
    JOUT(ALL(a), ", ", cout) << "}" << endl;

template <typename T>
ostream &JOUT(T s, T e, string sep = " ", ostream &os = cout)
{
    if (s != e)
    {
        os << *s;
        ++s;
    }
    while (s != e)
    {
        os << sep << *s;
        ++s;
    }
    return os;
}

ostream &YES(bool cond, string yes = "Yes", string no = "No", ostream &os = cout)
{
    if (cond)
    {
        os << yes << endl;
    }
    else
    {
        os << no << endl;
    }
    return os;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << '(' << p.first << ", " << p.second << ')';
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    os << '[';
    JOUT(ALL(v), ", ", os) << ']';
    return os;
}

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#pragma endregion template
#pragma region graph 0.2
template <typename W>
struct graph
{
    using E = pair<ll, W>;
    ll m;
    bool weighted;
    bool directed;
    vector<vector<E>> e;

    graph(ll n, ll m, bool weighted = false, bool directed = false) : m(m), directed(directed), weighted(weighted)
    {
        e.assign(n + 1, vector<E>());
    }

    void add(ll i, ll j, W w = 1)
    {
        e[i].push_back(E(j, w));
        if (not directed)
        {
            e[j].push_back(E(i, w));
        }
        ++m;
    }

    vector<E> &operator[](int i)
    {
        return e[i];
    }
};

template <typename W>
istream &operator>>(istream &is, graph<W> &g)
{
    REP(i, g.m)
    {
        ll from, to, w;
        is >> from >> to;
        if (g.weighted)
        {
            is >> w;
            g.add(from, to, w);
        }
        else
        {
            g.add(from, to);
        }
        --g.m;
    }
    return is;
}

#pragma endregion graph

int main()
{
    IN(ll, N);
    IN(ll, M);
    IN(ll, S);
    ll Z = 2501;
    ll X = N * Z;
    CH(min, S, Z - 1);
    graph<ll> G(X, 0, true, true);
    REP(i, M)
    {
        IN(ll, U);
        IN(ll, V);
        IN(ll, A);
        IN(ll, B);
        for (ll j = A; j < Z; ++j)
        {
            G.add((U - 1) * Z + j, (V - 1) * Z + j - A, B);
            G.add((V - 1) * Z + j, (U - 1) * Z + j - A, B);
        }
    }
    REP(i, N)
    {
        IN(ll, C);
        IN(ll, D);
        for (ll j = 0; j < Z - 1; ++j)
        {
            G.add(i * Z + j, i * Z + min(Z - 1, j + C), D);
        }
    }
    pq_asc<ii> q;
    vi dp(X + 1, INF);
    dp[S] = 0;
    q.push(ii(0, S));
    while (!q.empty())
    {
        auto [c, i] = q.top();
        q.pop();
        for (auto [j, w] : G[i])
        {
            if (c + w < dp[j])
            {
                dp[j] = c + w;
                q.push(ii(c + w, j));
            }
        }
    }
    for (ll i = 2; i <= N; i++)
    {
        ll ans = INF;
        for (ll j = 0; j < Z; j++)
        {
            ans = min(ans, dp[(i - 1) * Z + j]);
        }
        OUT(ans);
    }
}

Measured memory_bytes: 23716