// LUOGU_RID: 178154058
#include<bits/stdc++.h>
#define up(i,l,r) for(int i=(l);i<=(r);++i)
#define down(i,l,r) for(int i=(l);i>=(r);--i)
#define p_b push_back
#define m_p make_pair
#define pi pair<int,int>
#define p1 first
#define p2 second
#define ppc __builtin_popcount
#define nx(a,b) (*st[a].upper_bound(b))
using namespace std;
typedef long long ll;
const int maxn=2e6+10;
const int LIM=60;
const ll inf=1e18;
inline ll read(){
    ll x=0;short t=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')t=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return x*t;
}
int n,m,A[maxn],ct;
set<int>st[maxn];
const int M=1e7;
int hd[maxn],to[M],nxt[M],ect;
int dfn[maxn],low[maxn],stk[maxn],tp,instk[maxn],cc,bel[maxn],ccc;
struct lim {
    int i,j,k,x;
}d[maxn];
map<pair<pi,int>,int>mp;
int nd(int x,int y,int op){
    if(!mp.count(m_p(m_p(x,y),op)))return mp[m_p(m_p(x,y),op)]=++ct;
    return mp[m_p(m_p(x,y),op)];
}
void ins(int x,int y){
    ++ect;nxt[ect]=hd[x],to[ect]=y,hd[x]=ect;
}
void dfs(int u){
    dfn[u]=low[u]=++cc,stk[++tp]=u,instk[u]=1;
    for(int i=hd[u];i;i=nxt[i]){
        int x=to[i];
        if(!dfn[x])dfs(x),low[u]=min(low[u],low[x]);
        else if(instk[x])low[u]=min(low[u],dfn[x]);
    }if(dfn[u]==low[u]){
        ++ccc;
        while(tp){
            int x=stk[tp--];
            instk[x]=0,bel[x]=ccc;
            if(x==u)break;
        }
    }
}
void get(int a,int b,int c,int x){
    ins(nd(a,x,0),nd(b,x,1)),ins(nd(a,x,0),nd(c,x,1));
    ins(nd(a,nx(a,x),1),nd(b,nx(b,x),0)),ins(nd(a,nx(a,x),1),nd(c,nx(c,x),0));
    //g[nd(a,x,0)].p_b(nd(b,x,1)),g[nd(a,x,0)].p_b(nd(c,x,1));
    //g[nd(a,nx(a,x),1)].p_b(nd(b,nx(b,x),0)),g[nd(a,nx(a,x),1)].p_b(nd(c,nx(c,x),0));
}
int f[maxn];
void slv(){
    n=read(),m=read();
    up(i,1,m){
        int a=read(),b=read(),c=read(),x=read();
        d[i].i=a,d[i].j=b,d[i].k=c,d[i].x=x;
        st[a].insert(x),st[b].insert(x),st[c].insert(x);
    }up(i,1,n)st[i].insert(int(1e9+1));
    up(i,1,m){
        int a=d[i].i,b=d[i].j,c=d[i].k,x=d[i].x;
        get(a,b,c,x),get(b,a,c,x),get(c,a,b,x);
    }up(i,1,n)for(int x:st[i])nd(i,x,0),nd(i,x,1);
    up(i,1,n){
        for(auto it=++st[i].begin();it!=st[i].end();++it){
            int x=(*it);it--;int y=(*it);it++;
            //g[nd(i,x,1)].p_b(nd(i,y,1)),g[nd(i,y,0)].p_b(nd(i,x,0));
            ins(nd(i,x,1),nd(i,y,1)),ins(nd(i,y,0),nd(i,x,0));
        }
    }
    up(i,1,ct)if(!dfn[i])dfs(i);
    up(i,1,n)for(int x:st[i])if(bel[nd(i,x,0)]==bel[nd(i,x,1)]){
        printf("NO\n");return;
    }printf("YES\n");
    up(i,1,n){
        int res=-1,lst=-1;
        for(int x:st[i]){
            int a=nd(i,x,0),b=nd(i,x,1);
            if(bel[a]<bel[b]){res=lst;break;}
            lst=x;
        }f[i]=max(res,1);
    }up(i,1,m){
        int a=d[i].i,b=d[i].j,c=d[i].k,x=d[i].x;
        ll w=(ll)f[a]+f[b]+f[c]-max({f[a],f[b],f[c]})-min({f[a],f[b],f[c]});
        assert(w==x);
    }up(i,1,n)printf("%d ",f[i]);
}
int main(){
    //freopen("1.in","r",stdin),freopen("1.out","w",stdout);
    //int t=read();while(t--)slv();
    slv();
    return 0;
}
//(i,x,1)->(i,pre(x),1) (i,x,0)->(i,nxt(x),0)