#include <bits/stdc++.h>
inline long long read() {
  long long x = 0;
  char c = getchar(), f = 1;
  for (; c < '0' || '9' < c; c = getchar())
    if (c == '-') f = -1;
  for (; '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
  return x * f;
}
inline void write(long long x) {
  static char buf[20];
  int len = 0;
  if (x < 0) putchar('-'), x = -x;
  for (; x; x /= 10) buf[len++] = x % 10 + '0';
  if (!len)
    putchar('0');
  else
    while (len) putchar(buf[--len]);
}
inline void writesp(long long x) {
  write(x);
  putchar(' ');
}
inline void writeln(long long x) {
  write(x);
  putchar('\n');
}
struct edge {
  int to, nxt, d;
} e[2 * 200010];
int fir[200010], col[200010], vis[200010], ans[200010];
int cir[200010], val[200010];
std::vector<int> idx, idy;
int n, m, tot, tp;
void add_edge(int x, int y, int z) {
  e[tot].to = y;
  e[tot].d = z;
  e[tot].nxt = fir[x];
  fir[x] = tot++;
}
int dfs1(int now) {
  if (col[now] == 1)
    idx.push_back(now);
  else
    idy.push_back(now);
  for (int i = fir[now]; ~i; i = e[i].nxt)
    if (!col[e[i].to]) {
      col[e[i].to] = -col[now];
      int t = dfs1(e[i].to);
      if (t) {
        if (t == 1) cir[++tp] = e[i].to, val[tp] = e[i].d;
        if (now == cir[1]) t = -1;
        return t;
      }
    } else if (col[e[i].to] == col[now]) {
      cir[++tp] = e[i].to;
      val[tp] = e[i].d;
      return (now == e[i].to) ? -1 : 1;
    }
  return 0;
}
int dfs2(int now) {
  vis[now] = 1;
  for (int i = fir[now]; ~i; i = e[i].nxt)
    if (!vis[e[i].to]) {
      ans[e[i].to] = e[i].d - ans[now];
      if (dfs2(e[i].to)) return 1;
    } else if (ans[now] + ans[e[i].to] != e[i].d)
      return 1;
  return 0;
}
int solve1(int now) {
  int sum = 0;
  for (int i = 1; i <= tp; i++)
    if (i & 1)
      sum += val[i];
    else
      sum -= val[i];
  ans[cir[1]] = sum / 2;
  return dfs2(cir[1]);
}
int solve2(int now) {
  static int a[200010];
  ans[now] = 0;
  if (dfs2(now)) return 1;
  int tot = 0, szx = idx.size(), szy = idy.size();
  for (int i = 0; i < szx; i++) a[++tot] = ans[idx[i]];
  for (int i = 0; i < szy; i++) a[++tot] = -ans[idy[i]];
  std::sort(a + 1, a + tot + 1);
  int mid = a[(tot + 1) / 2];
  for (int i = 0; i < szx; i++) ans[idx[i]] -= mid;
  for (int i = 0; i < szy; i++) ans[idy[i]] += mid;
  return 0;
}
int main() {
  n = read();
  m = read();
  memset(fir, 255, sizeof(fir));
  tot = 0;
  for (int i = 1; i <= m; i++) {
    int x = read(), y = read(), z = read();
    add_edge(x, y, 2 * z);
    add_edge(y, x, 2 * z);
  }
  memset(col, 0, sizeof(col));
  memset(vis, 0, sizeof(vis));
  for (int i = 1; i <= n; i++)
    if (!vis[i]) {
      idx.clear();
      idy.clear();
      tp = 0;
      col[i] = 1;
      int flag1 = dfs1(i), flag2 = 0;
      if (flag1)
        flag2 = solve1(i);
      else
        flag2 = solve2(i);
      if (flag2) {
        puts("NO");
        return 0;
      }
    }
  puts("YES");
  for (int i = 1; i <= n; i++) printf("%.1f ", ans[i] / 2.0);
  putchar('\n');
  return 0;
}
