#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 100010
ll n,m;
unordered_map<ll,ll>dui[N];ll cn=1;
vector<ll>ji[N],bh[N];
ll u[N][3],val[N];
#define M 1000100
ll fir[M],v[M],nxt[M];ll cnt=0;
inline void Add(ll x,ll y){v[++cnt]=y;nxt[cnt]=fir[x];fir[x]=cnt;return ;}
inline void add(ll x,ll y){Add(x,y);Add(y^1,x^1);return ;}
ll dfn[M],low[M],dfncnt=0,col[M],colcnt=0;
ll st[M],top=0;
inline void tar(ll x){
    dfn[x]=low[x]=++dfncnt;st[++top]=x;
    for(int i=fir[x];i;i=nxt[i]){
        ll vi=v[i];if(!dfn[vi]){
            tar(vi);
            low[x]=min(low[x],low[vi]);
        }else if(!col[vi])low[x]=min(low[x],dfn[vi]);
    }if(dfn[x]==low[x]){
        col[x]=++colcnt;
        while(st[top]!=x){
            col[st[top]]=colcnt;top--;
        }top--;
    }return ;
}
int main(){
    // freopen("test1.in","r",stdin);
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>n>>m;for(int i=1,x,y,z,d;i<=m;i++){
        cin>>x>>y>>z>>d;ji[x].push_back(d);ji[y].push_back(d);ji[z].push_back(d);
        u[i][0]=x;u[i][1]=y;u[i][2]=z;val[i]=d;
    }for(int i=1;i<=n;i++)if(ji[i].empty())ji[i].push_back(1);
    for(int i=1;i<=n;i++){
        sort(ji[i].begin(),ji[i].end());
        for(int j=0;j<ji[i].size();j++)dui[i][ji[i][j]]=j,bh[i].push_back(++cn),cn++;
        for(int j=0;j+1<ji[i].size();j++)add(bh[i][j],bh[i][j+1]);
        add(bh[i][0],bh[i][0]^1);
    }for(int i=1;i<=m;i++){
        ll d=val[i];auto *x=u[i];ll tt=x[0];
        ll p[3];for(int j=0;j<=2;j++)p[j]=dui[x[j]][d];
        for(int j=0;j<=2;j++){
            for(int k=0;k<=2;k++)if(j!=k)add(bh[x[j]][p[j]],bh[x[k]][p[k]]^1);
        }for(int j=0;j<=2;j++){
            for(int k=0;k<=2;k++){
                if(j==k||p[j]+1>=ji[j].size())continue;
                ll tem=bh[x[j]][p[j]+1];
                if(p[k]+1<ji[k].size())tem=bh[k][p[k]+1];
                add(bh[x[j]][p[j]+1]^1,tem);
            }
        }
    }for(int i=2;i<=cn;i++)if(!dfn[i])tar(i);    
    ll kz=0;for(int i=1;i<=n;i++){
        for(int j=0;j<ji[i].size();j++)if(col[bh[i][j]]==col[bh[i][j]^1]){kz=1;break;}if(kz)break;  
    }if(kz){cout<<"NO";return 0;}cout<<"YES"<<'\n';
    for(int i=1;i<=n;i++){
        ll an=0;for(int j=0;j<ji[i].size();j++)if(col[bh[i][j]]>col[bh[i][j]^1])an=ji[i][j];
        cout<<an<<' ';
    }return 0;
}