#include <bits/stdc++.h>
using namespace std;
const long double inf = 1e6;
const long double unit = 1e-10;
long double dfs1(vector<vector<int>> &G, map<pair<int, int>, int> &wt,
                 vector<int> &yess, vector<pair<int, int>> &assign,
                 vector<int> &c, int seed) {
  yess.push_back(seed);
  c[seed] = 1;
  long double ans = -inf;
  for (auto chi : G[seed]) {
    pair<int, int> temp(wt[pair<int, int>(chi, seed)] - assign[seed].first,
                        (-assign[seed].second));
    if (c[chi] == 0) {
      assign[chi] = temp;
      ans = max(ans, dfs1(G, wt, yess, assign, c, chi));
    } else {
      if (temp != assign[chi]) {
        if (temp.second == assign[chi].second)
          ans = max(ans, inf);
        else {
          ans =
              max(ans, ((long double)(temp.first - assign[chi].first)) /
                           ((long double)(-temp.second + assign[chi].second)));
        }
      }
    }
  }
  return ans;
}
long double func(vector<int> &yess, vector<pair<int, int>> &assign,
                 long double helo) {
  long double ans = 0;
  for (auto j : yess) {
    ans += max(
        ((long double)assign[j].first + helo * ((long double)assign[j].second)),
        -((long double)assign[j].first +
          helo * ((long double)assign[j].second)));
  }
  return ans;
}
int main() {
  cout << fixed << setprecision(6);
  {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
  }
  int n, m;
  cin >> n >> m;
  vector<vector<int>> G(n);
  map<pair<int, int>, int> wt;
  int f = 0;
  for (int i = 0; i <= m - 1; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    a--;
    b--;
    if (wt.find(pair<int, int>(a, b)) == wt.end()) {
      wt[pair<int, int>(a, b)] = c;
      wt[pair<int, int>(b, a)] = c;
    } else {
      if (wt[pair<int, int>(a, b)] != c) {
        f = 1;
      }
    }
    G[a].push_back(b);
    G[b].push_back(a);
  }
  if (f) {
    cout << "NO"
         << "\n";
    return 0;
  }
  vector<pair<int, int>> assign(n, pair<int, int>(0, 1));
  vector<int> yess;
  vector<int> c(n, 0);
  vector<double> ans(n);
  for (int i = 0; i <= n - 1; i++) {
    if (c[i] == 0) {
      long double oof = dfs1(G, wt, yess, assign, c, i);
      if (oof == inf) {
        cout << "NO"
             << "\n";
        return 0;
      } else if (oof == -inf) {
        long double l = -inf, r = inf;
        while (l < r) {
          long double m = (l + r) / 2.0;
          long double r1, r2, r3;
          r1 = func(yess, assign, m - unit);
          r2 = func(yess, assign, m);
          r3 = func(yess, assign, m + unit);
          if ((r1 > r2) && (r2 < r3)) {
            oof = m;
            break;
          } else if (r1 < r3) {
            r = m - unit;
          } else if (r3 < r1) {
            l = m + unit;
          } else {
            oof = m;
            break;
          }
        }
        if (oof == -inf) oof = r;
      }
      for (auto j : yess) {
        ans[j] =
            (long double)assign[j].first + (long double)assign[j].second * oof;
      }
      yess.clear();
    }
  }
  for (auto i : wt) {
    long double dif = ans[i.first.first] + ans[i.first.second] - i.second;
    if ((dif >= 1e-6) || (dif <= -1e-6)) {
      cout << "NO"
           << "\n";
      return 0;
    }
  }
  cout << "YES"
       << "\n";
  ;
  for (int i = 0; i < n; i++) cout << ans[i] << ' ';
  ;
  cout << "\n";
}
