#include <bits/stdc++.h>
using namespace std;
const int nx=1e5+5;
int n, m, u, v, w, a[nx], b[nx], f, vs[nx];
double res[nx];
vector<tuple<int, int, int>> d[nx];
vector<int> comp;
set<double> s;
void dfs(int u, int p)
{
vs[u]=1;
comp.push_back(u);
for (auto [v, w, idx]:d[u])
{
if (idx==p) continue;
if (vs[v])
{
int sma=a[u]+a[v], smb=b[u]+b[v];
if (sma==0&&b[u]+b[v]==w) continue;
else if (sma==0&&b[u]+b[v]!=w)
{
f=1;
break;
}
s.insert(((double)(w-smb))/((double)sma));
}
else
{
a[v]=-a[u];
b[v]=w-b[u];
dfs(v, idx);
}
}
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>m;
for (int i=1; i<=m; i++) cin>>u>>v>>w, d[u].push_back({v, w, i}), d[v].push_back({u, w, i});
for (int i=1; i<=n; i++)
{
if (!vs[i])
{
comp.clear();
s.clear();
a[i]=1;
dfs(i, -1);
if (s.size()>1) f=1;
else if (s.size()==1)
{
double vl=*s.begin();
for (auto x:comp) res[x]=a[x]*vl+b[x];
}
else
{
vector<pair<int, int>> v;
for (auto x:comp) if (a[x]!=0) v.push_back({(-b[x])/a[x], x});
sort(v.begin(), v.end());
int md=(v.size())/2;
double t=0;
if (!v.empty()) t=v[md].first;
for (auto x:comp) res[x]=(double)t*a[x]+(double)b[x];
}
}
}
if (f) return cout<<"NO\n", 0;
cout<<"YES\n";
for (int i=1; i<=n; i++) cout<<setprecision(8)<<res[i]<<' ';
}
