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

int main(){
  using mint=atcoder::modint;
  int n,m,b;
  cin>>n>>m>>b;
  mint::set_mod(b);
  vector<vector<pair<int,int>>> g(n);
  atcoder::dsu uf(n);
  for (int i=0;i<m;i++){
    int u,v,c;
    cin>>u>>v>>c;
    u--;v--;
    g[u].push_back({v,c});
    g[v].push_back({u,c});
    uf.merge(u,v);
  }
  vector<bool> vis(n);
  vector<int> val(n);
  queue<int> q;
  for (auto vec:uf.groups()){
    for (int s=0;s<b;s++){
      q.push(vec[0]);
      val[vec[0]]=s;
      bool ok=true;
      while (!q.empty()){
        auto v=q.front();
        q.pop();
        vis[v]=true;
        for (auto [u,c]:g[v]){
          int next=(c-val[v]+b)%b;
          if (vis[u]){
            if (next!=val[u]){
              ok=false;
            }
          }
          else{
            val[u]=next;
            q.push(u);
          }
        }
      }
      for (int v:vec) vis[v]=false;
      if (ok) break;
      else if (s==b-1){
        cout<<"No\n";
        return 0;
      }
    }
  }
  cout<<"Yes\n";
  for (int i=0;i<n;i++) cout<<val[i]<<" \n"[i==n-1];
}