#include <bits/stdc++.h>
template <class c>
int popc(c a) {
  if (sizeof(c) == 8)
    return __builtin_popcountll(a);
  else
    return __builtin_popcount(a);
}
template <class c>
int ctz(c a) {
  if (sizeof(c) == 8)
    return __builtin_ctzll(a);
  else
    return __builtin_ctz(a);
}
template <class c>
int clz(c a) {
  if (sizeof(c) == 8)
    return __builtin_clzll(a);
  else
    return __builtin_clz(a);
}
inline int min(const int &first, const int &second) {
  return (((second - first) >> (32 - 1)) & (first ^ second)) ^ first;
}
inline int max(const int &first, const int &second) {
  return (((second - first) >> (32 - 1)) & (first ^ second)) ^ second;
}
inline long long min(const long long &first, const long long &second) {
  return (((second - first) >> (64 - 1)) & (first ^ second)) ^ first;
}
inline long long max(const long long &first, const long long &second) {
  return (((second - first) >> (64 - 1)) & (first ^ second)) ^ second;
}
using namespace std;
char string_in_buffer[(int)260];
void fast_scan(int &first) { scanf("%d", &first); }
void fast_scan(long long &first) { scanf("%lld", &first); }
void fast_scan(unsigned long long &first) { scanf("%llu", &first); }
void fast_scan(double &first) { scanf("%lf", &first); }
void fast_scan(long double &first) { scanf("%Lf", &first); }
void fast_scan(char &first) {
  scanf("%c", &first);
  if (first == '\n') {
    fast_scan(first);
  }
}
void fast_scan(string &first) {
  scanf("%s", string_in_buffer);
  first = string(string_in_buffer);
}
template <class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
  fast_scan(p.first);
  fast_scan(p.second);
}
template <class T>
void fast_scan(vector<T> &v) {
  for (auto &first : v) fast_scan(first);
}
void fast_print(const int &first) { printf("%d", first); }
void fast_print(const unsigned int &first) { printf("%u", first); }
void fast_print(const long long &first) { printf("%lld", first); }
void fast_print(const unsigned long long &first) { printf("%llu", first); }
void fast_print(const char &first) { printf("%c", first); };
void fast_print(const double &first) { printf("%.15lf", first); }
void fast_print(const long double &first) { printf("%.15Lf", first); }
void fast_print(const string &first) { printf("%s", first.c_str()); }
void fast_print(const char v[]) { fast_print((string)v); }
template <class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
  fast_print(p.first);
  fast_print(' ');
  fast_print(p.second);
}
template <class T>
void fast_print(const vector<T> &v) {
  if (v.empty()) return;
  fast_print(v[0]);
  for (int i = 1; i < v.size(); i++) {
    fast_print(' ');
    fast_print(v[i]);
  }
}
template <class T>
void fast_print(const vector<vector<T>> &v) {
  if (v.empty()) return;
  fast_print(v[0]);
  for (int i = 1; i < v.size(); i++) {
    fast_print('\n');
    fast_print(v[i]);
  }
}
template <class T>
void fast_print(const T &v) {
  for (const auto &first : v) {
    fast_print(first);
    fast_print(' ');
  }
}
using namespace std;
namespace smart_io {
string print_start = "";
string sep = " ";
bool first_print = false;
void precall_print() {
  fast_print(print_start);
  print_start = "\n";
  first_print = true;
}
void _print(deque<string>) {}
template <class T, class... Args>
void _print(deque<string> names, T elem, Args... args) {
  if (!first_print) {
    fast_print("\n");
  } else {
    first_print = false;
  }
  fast_print(names.front());
  fast_print(" = ");
  fast_print(elem);
  names.pop_front();
  _print(names, args...);
}
}  // namespace smart_io
template <class T>
ostream &operator,(ostream &os, const T &object) {
  if (!smart_io::first_print) {
    fast_print(smart_io::sep);
  } else {
    smart_io::first_print = false;
  }
  fast_print(object);
  return os;
}
template <class T>
istream &operator,(istream &is, T &object) {
  fast_scan(object);
  return is;
}
namespace escape__from__random__aetuhoetnuhshe {
using namespace std::chrono;
mt19937 rng(duration_cast<milliseconds>(system_clock::now().time_since_epoch())
                .count());
uniform_real_distribution<> prob_dist(0.0, 1.0);
};  // namespace escape__from__random__aetuhoetnuhshe
namespace typedefs {}
namespace numbers_operation {
template <class T>
inline T floor_mod(T a, const T &b) {
  a %= b;
  if (a < 0) a += b;
  return a;
}
}  // namespace numbers_operation
using namespace numbers_operation;
using namespace typedefs;
using namespace escape__from__random__aetuhoetnuhshe;
int n, m;
vector<vector<pair<int, int>>> g;
vector<bool> used[2];
vector<int> c[2];
vector<pair<int, int>> vis;
void dfs(int t, int v) {
  used[t][v] = true;
  vis.emplace_back(t, v);
  for (pair<int, int> pp : g[v]) {
    if (!used[1 - t][pp.first]) {
      c[1 - t][pp.first] = pp.second - c[t][v];
      dfs(1 - t, pp.first);
    } else if (c[1 - t][pp.first] != pp.second - c[t][v]) {
      smart_io::precall_print();
      cout, "NO";
      exit(0);
    }
  }
}
double eval(double first) {
  double S = 0;
  for (pair<int, int> pp : vis) {
    if (pp.first) {
      if (used[0][pp.second]) continue;
      S += abs(c[1][pp.second] - first);
    } else
      S += abs(c[0][pp.second] + first);
  }
  return S;
}
signed main(signed argc, char *argv[]) {
  cin, n, m;
  g.resize(n);
  for (int i = 0; i < (m); i++) {
    int a, b, t;
    cin, a, b, t;
    a--;
    b--;
    g[a].emplace_back(b, t);
    g[b].emplace_back(a, t);
  }
  used[0].resize(n, false);
  used[1].resize(n, false);
  c[0].resize(n);
  c[1].resize(n);
  vector<double> rez(n, 1e9);
  for (int i = 0; i < (n); i++) {
    if (!used[0][i] && !used[1][i]) {
      c[0][i] = 0;
      vis.clear();
      dfs(0, i);
      int l = -1e9;
      int r = 1e9;
      for (pair<int, int> pp : vis) {
        if (used[0][pp.second] && used[1][pp.second]) {
          l = max(l, c[1][pp.second] - c[0][pp.second]);
          r = min(r, c[1][pp.second] - c[0][pp.second]);
        }
      }
      if (l > r) {
        smart_io::precall_print();
        cout, "NO";
        exit(0);
      }
      double exact = ((double)l) / 2.0;
      if (l == -1e9) {
        double low = -1e9;
        double high = 1e9;
        for (int t = 0; t < (200); t++) {
          double l1 = (low + low + high) / 3;
          double r1 = (low + high + high) / 3;
          if (eval(l1) > eval(r1)) {
            low = l1;
          } else
            high = r1;
        }
        exact = low;
      }
      for (pair<int, int> pp : vis) {
        if (pp.first) {
          rez[pp.second] = c[1][pp.second] - exact;
        } else {
          rez[pp.second] = c[0][pp.second] + exact;
        }
      }
    }
  }
  smart_io::precall_print();
  cout, "YES";
  smart_io::precall_print();
  cout, rez;
}
