#include <bits/stdc++.h>
using namespace std;
#define name "TENBAI"
#define fi first
#define se second
#define int long long
#define endl '\n'
#define setmin(x, y) x = min((x), (y))
#define setmax(x, y) x = max((x), (y))
#define sqr(x) ((x) * (x))
#define all(x) x.begin(), x.end()
mt19937 hdp(chrono::high_resolution_clock::now().time_since_epoch().count());
int rand(int l, int r){return l + ((hdp() % (r - l + 1)) + r - l + 1) % (r - l + 1);}
const int NM = 2e5 + 5;
const double SUS = -69;
pair<int, int> a[NM], sum;
double force, siu[NM];
pair<double, double> ans;
map<pair<int, int>, int> mp;
int n, m;
bool vis[NM];
vector<pair<int, int>> g[NM];
vector<int> cur;
void dfs(int u)
{
cur.push_back(u);
vis[u] = 1;
mp[{a[u].fi, a[u].se}]++;
for (auto t : g[u])
{
int v = t.fi, w = t.se;
if (!vis[v])
{
a[v].fi = -a[u].fi, a[v].se = w - a[u].se;
dfs(v);
}
else
{
if (a[u].fi + a[v].fi == 0)
{
if (a[u].se + a[v].se != w)
{
cout << "NO";
exit(0);
}
}
else
{
double t = double(w - (a[u].se + a[v].se)) / (a[u].fi + a[v].fi);
if (force == SUS)
force = t;
else if (force != t)
{
cout << "NO";
exit(0);
}
}
}
}
}
void solve()
{
force = -69;
cin >> n >> m;
for (int i = 1; i <= m; i++)
{
int u, v, w;
cin >> u >> v >> w;
g[u].emplace_back(v, w);
g[v].emplace_back(u, w);
}
for (int i = 1; i <= n; i++)
if (!vis[i])
{
cur.clear();
force = SUS;
a[i] = {1, 0};
dfs(i);
if (force != SUS)
ans.se = force;
else if (force == SUS)
{
ans.fi = 1e9;
vector<double> TRY;
for (auto x : mp)
TRY.push_back(-double(x.fi.se) / x.fi.fi);
for (auto t : TRY)
{
double sum = 0;
for (int i : cur)
sum += abs(t * a[i].fi + a[i].se);
setmin(ans, make_pair(sum, t));
}
}
for (int i : cur)
siu[i] = a[i].fi * ans.se + a[i].se;
}
cout << "YES\n";
for (int i = 1; i <= n; i++)
cout << siu[i] << ' ';
}
signed main()
{
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int tc = 1;
// cin >> tc;
while (tc--)
solve();
}
