#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n,m;
struct node{
	int i[3],x;
}q[N];
int a[N];
mt19937 rnd(time(0));
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		a[i]=1;
	}
	for(int i=1;i<=m;i++){
		cin>>q[i].i[0]>>q[i].i[1]>>q[i].i[2]>>q[i].x;
		shuffle(q[i].i,q[i].i+3,rnd);
		a[q[i].i[0]]=q[i].x;
	}
	double s=clock();
	while((clock()-s)/CLOCKS_PER_SEC<0.95){
		bool flag=1;
		for(int i=1;i<=m;i++){
			if(a[q[i].i[0]]+a[q[i].i[1]]+a[q[i].i[2]]-max(a[q[i].i[0]],max(a[q[i].i[1]],a[q[i].i[2]]))-min(a[q[i].i[0]],min(a[q[i].i[1]],a[q[i].i[2]]))!=q[i].x){
				shuffle(q[i].i,q[i].i+3,rnd);
				a[q[i].i[0]]=q[i].x;
				flag=0;
//				break;
			}
		}
		if(flag){
			cout<<"YES\n";
			for(int i=1;i<=n;i++){
				cout<<a[i]<<' ';
			}
			return 0;
		}
	}
	cout<<"NO";
	return 0;
}