#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
const int mod = 998244353;
const int INF = 0x3f3f3f3f;
const long long llINF = 0x3f3f3f3f3f3f3f3f;
long long make_compiler_happy() { return INF & maxn & mod & llINF; }
long long fpow(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long inv(long long x) { return fpow(x, mod - 2); }
int n, m;
vector<pair<int, int> > g[maxn];
bool vis[maxn];
double ans[maxn];
pair<int, int> val[maxn];
vector<int> tt;
int ok = 1;
int flag = 0;
double res;
void dfs(int u) {
  vis[u] = 1;
  tt.push_back(u);
  for (auto t : g[u]) {
    int v = t.first, c = t.second;
    if (vis[v]) {
      if (val[u].first + val[v].first == 0) {
        if (val[u].second + val[v].second != c) {
          ok = 0;
          return;
        }
      } else {
        double tmp = (double)(c - (val[u].second + val[v].second)) /
                     (val[u].first + val[v].first);
        if (!flag) {
          flag = 1;
          res = tmp;
        } else if (fabs(res - tmp) > 1e-6) {
          ok = 0;
          return;
        }
      }
    } else {
      val[v].first = -val[u].first;
      val[v].second = -val[u].second + c;
      dfs(v);
    }
  }
}
void dfs2(int u) {
  vis[u] = 1;
  ans[u] = res * val[u].first + val[u].second;
  for (auto t : g[u]) {
    int v = t.first;
    if (!vis[v]) {
      dfs2(v);
    }
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m;
  for (int i = 0; i < (m); i++) {
    int u, v, c;
    cin >> u >> v >> c;
    g[u].push_back(make_pair(v, c));
    g[v].push_back(make_pair(u, c));
  }
  for (int i = (1); i <= (n); i++) {
    if (!vis[i]) {
      tt.clear();
      val[i].first = 1;
      val[i].second = 0;
      flag = 0;
      dfs(i);
      if (!flag) {
        vector<double> v;
        for (int j : tt)
          for (int k = 0; k < (abs(val[j].first)); k++)
            v.push_back(-(double)val[j].second / val[j].first);
        sort((v).begin(), (v).end());
        res = v[((int)v.size()) / 2];
      }
      for (int j : tt) vis[j] = 0;
      dfs2(i);
    }
  }
  if (!ok) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
    for (int i = (1); i <= (n); i++)
      cout << fixed << setprecision(10) << ans[i] << ' ';
  }
}
