#include<bits/stdc++.h>
#define N 100010
#define add push_back
#define For(i,a,b) for(register int i=a;i<=b;i++)
using namespace std;
int n,m,rnk,tot,dfn[N<<3],top,ans[N];
int a[N],b[N],c[N],v[N],in[N<<3];
int id[N<<2][2],low[N<<3],sta[N<<3];
const int inf=1e9;
bool insta[N<<3],con[N<<2];
vector<int> go[N],h[N],nd[N];
inline void edge(int x,int y){go[x].add(y);}
inline void ckmn(int &x,int y){x=min(x,y);}
inline int read()
{
    register int x=0,c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
    return x;
}

inline int binary(int id,int val)
{
    int l=0,r=h[id].size()-1,res=0;
    while(l <= r)
    {
        int mid=l+r>>1;
        if(h[id][mid] >= val) res=mid,r=mid-1;
        else l=mid+1;
    }
    return res;
}

inline void addedge(int i,int j,int k,int v)
{
    int ri=binary(i,v),rj=binary(j,v),rk=binary(k,v);
    if(ri+1 == h[i].size())
        edge(id[nd[i][ri+1]][1],id[nd[i][ri+1]][0]);
    else 
    {
        edge(id[nd[i][ri+1]][1],id[nd[j][rj+1]][0]);
        edge(id[nd[i][ri+1]][1],id[nd[k][rk+1]][0]);
    }
    if(!ri)
        edge(id[nd[i][ri]][0],id[nd[i][ri]][1]);
    else
    {
        edge(id[nd[i][ri]][0],id[nd[j][rj]][1]);
        edge(id[nd[i][ri]][0],id[nd[k][rk]][1]);
    }
    return;
}

inline void tarjan(int x)
{
    dfn[x]=low[x]=++dfn[0];
    insta[sta[++top]=x]=true;
    for(int to:go[x])
        if(!dfn[to]) tarjan(to),ckmn(low[x],low[to]);
        else if(insta[to]) ckmn(low[x],dfn[to]);
    if(low[x] != dfn[x]) return;
    in[0]++,sta[top+1]=0;
    while(sta[top+1] != x)
    {
        int nw=sta[top--];
        insta[nw]=false,in[nw]=in[0];
    }
    return;
}

int main()
{
    n=read(),m=read();
    For(i,1,m)
    {
        a[i]=read(),b[i]=read(),c[i]=read(),v[i]=read();
        h[a[i]].add(v[i]),h[b[i]].add(v[i]),h[c[i]].add(v[i]);
    }
    For(i,1,n) 
    {
        int sz=h[i].size();
        sort(h[i].begin(),h[i].end());
        For(j,1,sz+1) nd[i].add(++rnk);
    }For(i,1,rnk) id[i][0]=++tot,id[i][1]=++tot;
    For(i,1,m) 
    {
        addedge(a[i],b[i],c[i],v[i]);
        addedge(b[i],a[i],c[i],v[i]);
        addedge(c[i],a[i],b[i],v[i]);
    }
    For(i,1,n) 
    {
        int sz=h[i].size();
        For(j,0,sz-1) edge(id[nd[i][j]][0],id[nd[i][j+1]][0]);
        For(j,1,sz) edge(id[nd[i][j]][1],id[nd[i][j-1]][1]);
    }For(i,1,tot) if(!dfn[i]) tarjan(i);
    For(i,1,rnk) if(in[id[i][0]] == in[id[i][1]]) 
        {puts("NO");return 0;}
    For(i,1,rnk) con[i]=(in[id[i][1]]<in[id[i][0]]);
    For(i,1,n)
    {
        if(h[i].empty()) {ans[i]=20061130;continue;}
        int sz=h[i].size(),pos=0;
        For(j,0,sz-1) if(!con[nd[i][j+1]]) 
            {pos=j;break;}
        ans[i]=h[i][pos];
    }puts("YES");
    For(i,1,n) printf("%d ",ans[i]);
    return 0;
}