#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, b;
  cin >> n >> m >> b;
  vector<vector<P>> to(n);
  rep(_, m) {
    int u, v, c;
    cin >> u >> v >> c;
    u--, v--;
    to[u].emplace_back(v, c);
    to[v].emplace_back(u, c);
  }
  vector<char> visited(n);
  bool ok = true;
  VI ans(n);
  VI side(n);
  rep(i, n) if (!visited[i]) {
    VI vs[2];
    bool added = false;
    auto dfs = [&](auto&& self, int u) -> void {
      vs[side[u]].emplace_back(u);
      visited[u] = true;
      for (auto [v, c] : to[u]) {
        if (visited[v]) {
          if (side[v] != side[u] || added) {
            if ((ans[u] + ans[v]) % b != c) ok = false;
          } else {
            added = true;
            int d = (ans[u] + ans[v] + b - c) % b;
            if (!side[u]) d = (b - d) % b;
            // 2x = d mod b
            if (d % 2 == 0) d /= 2;
            else if (b % 2) d = (b + 1) / 2 * (ll)d % b;
            else {
              ok = false;
              continue;
            }
            for (int& w : vs[0]) ans[w] = (ans[w] + d) % b;
            for (int& w : vs[1]) ans[w] = (ans[w] + b - d) % b;
            assert((ans[u] + ans[v]) % b == c);
          }
        } else {
          ans[v] = (c + b - ans[u]) % b;
          side[v] = side[u] ^ 1;
          self(self, v);
        }
      }
    };
    dfs(dfs, i);
  }
  if (!ok) {
    cout << "No\n";
  } else {
    cout << "Yes\n";
    rep(i, n) cout << ans[i] << " \n"[i + 1 == n];
  }
}