#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<set>
#include<vector>
#define mkp(a,b) make_pair(a,b)
#define pr pair<int,int>
using namespace std;
const int aaa=500010;
const int LOG=20;
const int inf=0x3f3f3f3f;
int n,m,s,l[aaa],i,j,t,u[aaa],v[aaa],r[aaa],dep[aaa],x,fa[aaa][LOG+1],mal[aaa][LOG+1],val[aaa],out[aaa],id[aaa];
queue<int>q;
vector<int>inser[aaa];
vector<int>delet[aaa];
vector<pr >ve[aaa];
vector<pr >to[aaa];
multiset<int>gl[aaa];
priority_queue<pr,vector<pr >,greater<pr > >zgl;
void updatemi(int &x,int y)
{
    x=min(x,y);
}
void updatema(int &x,int y)
{
    x=max(x,y);
}
pr LCA(int x,int y)
{
    // cout<<"XY"<<x<<" "<<y<<endl;
    if(dep[x]<=dep[y])
        swap(x,y);
    int i,ans=0;
    for(i=LOG;i>=0;i--)
        if(dep[fa[x][i]]>=dep[y])
        {
            updatema(ans,mal[x][i]);
            x=fa[x][i];
        }
    if(x==y)
        return mkp(x,ans);
    for(i=LOG;i>=0;i--)
        if(fa[x][i]!=fa[y][i])
        {
            updatema(ans,max(mal[x][i],mal[y][i]));
            x=fa[x][i];
            y=fa[y][i];
        }
    updatema(ans,max(mal[x][0],mal[y][0]));
    return mkp(fa[x][0],ans);
}
int dfs(int x,int fa)
{
    int i;
    // cout<<"x"<<x<<endl;
    id[x]=x;
    for(i=0;i<to[x].size();i++)
    {
        int y=to[x][i].first;
        if(y!=fa)
        {
            r[to[x][i].second]=dfs(to[x][i].first,x);
            // cout<<to[x][i].second<<" "<<r[to[x][i].second]<<endl;
            if(gl[id[x]].size()<gl[id[y]].size())
            {
                while(!gl[id[x]].empty())
                {
                    gl[id[y]].insert(*gl[id[x]].begin());
                    gl[id[x]].erase(gl[id[x]].begin());
                }
                id[x]=id[y];
            }
            else
            {
                while(!gl[id[y]].empty())
                {
                    gl[id[x]].insert(*gl[id[y]].begin());
                    gl[id[y]].erase(gl[id[y]].begin());
                }
            }
        }
    }
    for(i=0;i<inser[x].size();i++)
        gl[id[x]].insert(inser[x][i]);
    for(i=0;i<delet[x].size();i++)
        gl[id[x]].erase(gl[id[x]].find(delet[x][i]));
    if(!gl[id[x]].empty())
        updatemi(val[x],*gl[id[x]].begin());
        // for(i=1;i<=m;i++)
        // {
        //     cout<<i<<" "<<l[i]<<" "<<r[i]<<endl;
        // }
    return val[x];
}
void ALLCLEAR()
{
    for(int i=1;i<=m;i++)
    {
        id[i]=0;
        dep[i]=val[i]=out[i]=0;
        for(int j=0;j<=LOG;j++)
            fa[i][j]=mal[i][j]=0;
        inser[i].clear();
        delet[i].clear();
        ve[i].clear();
        to[i].clear();
        gl[i].clear();
    }
    while(!q.empty())
        q.pop();
    while(!zgl.empty())
        zgl.pop();
}
int main()
{
    scanf("%d",&t);
    for(;t>=1;t--)
    {
        scanf("%d%d",&n,&m);
        for(i=1;i<=m;i++)
        {
            scanf("%d%d%d%d",&u[i],&v[i],&l[i],&r[i]);
            if(i<n)
            {
                to[u[i]].push_back(mkp(v[i],i));
                to[v[i]].push_back(mkp(u[i],i));
            }
        }
        dep[1]=1;
        q.push(1);
        while(!q.empty())
        {
            int x=q.front();
            // cout<<"X"<<x<<endl;
            q.pop();
            for(i=0;i<to[x].size();i++)
            {
                // cout<<to[x][i].first<<endl;
                if(dep[to[x][i].first])
                    continue;
                int y=to[x][i].first;
                dep[y]=dep[x]+1;
                q.push(y);
                val[y]=r[to[x][i].second];
                // cout<<"ZGL"<<y<<" "<<val[y]<<endl;
                fa[y][0]=x;
                mal[y][0]=l[to[x][i].second];
                for(j=1;j<=LOG;j++)
                {
                    fa[y][j]=fa[fa[y][j-1]][j-1];
                    mal[y][j]=max(mal[fa[y][j-1]][j-1],mal[y][j-1]);
                }
            }
        }
        // for(i=1;i<=n;i++)
        //     printf("%d ",dep[i]);
        // puts("");
        for(i=n;i<=m;i++)
        {
            pr lca=LCA(u[i],v[i]);
            updatema(l[i],lca.second);
            inser[u[i]].push_back(r[i]);
            inser[v[i]].push_back(r[i]);
            delet[lca.first].push_back(r[i]);
            delet[lca.first].push_back(r[i]);
            // printf("%d %d\n",lca.first,lca.second);
        }
        // for(i=1;i<=n;i++)
        //     cout<<val[i]<<" ";
        // puts("");
        // for(i=1;i<=m;i++)
        // {
        //     cout<<"QWQ"<<i<<" "<<l[i]<<" "<<r[i]<<endl;
        // }
        dfs(1,0);
        // for(i=1;i<=n;i++)
        //     cout<<val[i]<<" ";
        // puts("");
        // for(i=1;i<=m;i++)
        // {
        //     cout<<"QAQ"<<i<<" "<<l[i]<<" "<<r[i]<<endl;
        // }
        for(i=1;i<=m;i++)
            ve[l[i]].push_back(mkp(r[i],i));
        // cout<<zgl.size()<<endl;
        for(i=1;i<=m;i++)
        {
            for(j=0;j<ve[i].size();j++)
                zgl.push(ve[i][j]);
            if(zgl.empty())
                break;
            pr x=zgl.top();
            zgl.pop();
            if(x.first<i)
                break;
            out[x.second]=i;
        }
        if(i<=m)
        {
            puts("NO");
            ALLCLEAR();
            continue;
        }
        puts("YES");
        for(i=1;i<=m;i++)
            printf("%d ",out[i]);
        puts("");
        ALLCLEAR();
    }
}