#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<class t,class ...A> inline void read(t &x,A &...a){
read(x);read(a...);
}
template<class t> inline void write(t x){
if(x<0) putchar('-'),write(-x);
else{if(x>9) write(x/10);putchar('0'+x%10);}
}
#define edge pair<int,int>
#define x first
#define v second
const int N=1e5+5;
vector<edge> g[N];
int n,m,A[N],B[N];
double ans[N];
vector<double> val;
vector<int> nd,num;
void GG(){
puts("NO");
exit(0);
}
void dfs(int x,int a,int b){
if(!A[x]){
A[x]=a;
B[x]=b;
}
else if(A[x]!=a||B[x]!=b){
if(A[x]==a) GG();
val.push_back(1.0*(b-B[x])/(A[x]-a));
return ;
}
else return ;
nd.push_back(x);
num.push_back(a*b);
for(edge e:g[x]) dfs(e.x,-a,e.v-b);
}
signed main(){
read(n,m);
for(int i=1,x,y,z;i<=m;i++){
read(x,y,z);
g[x].emplace_back(y,z);
g[y].emplace_back(x,z);
}
for(int i=1;i<=n;i++) if(!A[i]){
val.clear();nd.clear();num.clear();
dfs(i,1,0);
if(val.size()){
if(*max_element(val.begin(),val.end())!=*min_element(val.begin(),val.end())) GG();
for(int x:nd) ans[x]=A[x]*val[0]+B[x];
}
else{
nth_element(num.begin(),num.begin()+nd.size()/2,num.end());
int v=-num[nd.size()/2];
for(int x:nd) ans[x]=A[x]*v+B[x];
}
}
puts("YES");
for(int i=1;i<=n;i++) printf("%.1lf ",ans[i]);
}
