#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int getInt(){int x;scanf("%d",&x);return x;}
template<typename T>istream& operator>>(istream&i,v(T)&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v){stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const v(T)&v){if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
template<typename T>ll suma(const v(T)&a){ll res(0);for(auto&&x:a)res+=x;return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("NO"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;

vi to[MX];
vi col;

bool cfs(int v, int c) {
  if (col[v] == (c^1)) return false;
  if (col[v] != -1) return true;
  col[v] = c;
  rep(i,sz(to[v])) {
    int u = to[v][i];
    if (!cfs(u,c^1)) return false;
  }
  return true;
}


int main() {
  int n,m;
  scanf("%d%d",&n,&m);
  vt es;
  rep(i,m) {
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    --a; --b;
    to[a].pb(b);
    to[b].pb(a);
    if (c) {
      es.eb(a,b,1);
      es.eb(b,a,-1);
    } else {
      es.eb(a,b,1);
      es.eb(b,a,1);
    }
  }
  col = vi(n,-1);
  if (!cfs(0,0)) dame;

  int ans = -1;
  vi as;
  rep(sv,n) {
    vi dist(n,INF);
    dist[sv] = 0;
    bool upd = true;
    int tm = 0;
    while (upd && tm < n+5) {
      upd = false;
      for (auto&& e : es) {
        int a, b, c;
        tie(a,b,c) = e;
        if (dist[b] > dist[a]+c) {
          upd = true;
          dist[b] = dist[a]+c;
        }
      }
      ++tm;
    }
    if (tm == n+5) dame;

    int lx = 0;
    rep(i,n) mins(lx,dist[i]);
    rep(i,n) dist[i] -= lx;
    int now = 0;
    rep(i,n) maxs(now, dist[i]);
    if (ans < now) as = dist, ans = now;
  }
  if (ans == -1) dame;
  cout<<"YES"<<endl;
  cout<<ans<<endl;
  cout<<as<<endl;
  return 0;
}
