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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
  ll N, M, C;
  cin >> N >> M >> C;
  vector G(N, vector<pll>());
  rep(i, M) {
    ll U, V, W;
    cin >> U >> V >> W;
    --U, --V;
    G[U].push_back(pll{V, W});
    G[V].push_back(pll{U, W});
  }
  vl fDist(N, INFL), bDist0(N, INFL), bDist1(N, INFL);
  fDist[0] = 0;
  priority_queue<pll, vector<pll>, greater<pll>> pq;
  pq.push(pll{0, 0});
  while (!pq.empty()) {
    auto [w, v] = pq.top();
    pq.pop();
    if (fDist[v] < w)
      continue;
    for (auto [u, c] : G[v]) {
      if (fDist[u] > w + c + C) {
        fDist[u] = w + c + C;
        pq.push(pll{fDist[u], u});
      }
    }
  }
  bDist0[N - 1] = 0;
  pq.push(pll{0, N - 1});
  while (!pq.empty()) {
    auto [w, v] = pq.top();
    pq.pop();
    if (bDist0[v] < w)
      continue;
    for (auto [u, c] : G[v]) {
      if (bDist0[u] > w + c + C) {
        bDist0[u] = w + c + C;
        pq.push(pll{bDist0[u], u});
      }
      if (bDist1[u] > w + C) {
        bDist1[u] = w + C;
      }
    }
  }
  rep(i, N) chmin(bDist1[i], bDist0[i]);

  rep(i, N) { pq.push(pll{bDist1[i], i}); }
  while (!pq.empty()) {
    auto [w, v] = pq.top();
    pq.pop();
    if (bDist1[v] < w)
      continue;
    for (auto [u, c] : G[v]) {
      if (bDist1[u] > w + c + C) {
        bDist1[u] = w + c + C;
        pq.push(pll{bDist1[u], u});
      }
    }
  }
  ll base = fDist[N - 1];
  rep(i, 1, N) { cout << min(base, fDist[i] + bDist1[i]) << '\n'; }
}