#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1e5 + 10;

int n, m;
vector < pair <int, int> > e[MAXN];

lf res[MAXN];
int k[MAXN], b[MAXN], xx = -2e9, id[MAXN], top;
bool flag = 1;
void DFS(int u)
{
    id[++top] = u;
    if (!flag) return;
    for (auto t : e[u])
    {
        int v = t.first, w = t.second;
        if (!k[v]) {k[v] = -k[u], b[v] = w - b[u], DFS(v); continue;}
        int vk = -k[u], vb = w - b[u];
        if (vk == k[v] && vb == b[v]) continue;
        if (vk == k[v]) {flag = 0; return;}
        int x = (vb - b[v]) * (k[v] - vk > 0 ? 1 : -1);
        if (xx == -2e9 || xx == x) xx = x;
        else {flag = 0; return;}
    }
}

int tmp[MAXN];

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    Read(n), Read(m);
    for (int i = 1, u, v, w; i <= m; i++) Read(u), Read(v), Read(w), e[u].push_back(make_pair(v, w)), e[v].push_back(make_pair(u, w));
    for (int i = 1; i <= n; i++)
    {
        if (k[i]) continue;
        k[i] = 1, b[i] = 0, xx = -2e9, top = 0;
        DFS(i);
        // for (int j = 1; j <= top; j++) cout << id[j] << " " << k[id[j]] << " " << b[id[j]] << "\n";
        if (!flag) return cout << "NO\n", 0;
        if (xx != -2e9)
            for (int j = 1; j <= top; j++) res[id[j]] = (lf)k[id[j]] * (xx / 2.0) + b[id[j]];
        else
        {
            for (int j = 1; j <= top; j++) tmp[j] = -b[id[j]] * k[id[j]];
            sort(tmp + 1, tmp + top + 1);
            int x = tmp[(top + 1) / 2];
            // cout << x << "\n";
            for (int j = 1; j <= top; j++) res[id[j]] = (lf)k[id[j]] * x + b[id[j]];
        }
    }
    cout << "YES\n";
    for (int i = 1; i <= n; i++) cout << res[i] << " "; cout << "\n";
    return 0;
}