#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

const int tree_siz = (1 << 20)-1;
int drzewo[tree_siz];

int get_min(int akt, int p1, int p2, int s1, int s2)
{
    if(p2 < s1 || p1 > s2) return 1e9;
    if(p1 >= s1 && p2 <= s2) return drzewo[akt-1];
    return min(get_min(akt*2,p1,(p1+p2)/2,s1,s2),get_min(akt*2+1,(p1+p2)/2+1,p2,s1,s2));
}

void upd(int v)
{
    drzewo[v-1] = min(drzewo[v*2-1],drzewo[v*2]);
    if(v != 1) upd(v/2);
}

void change(int ind, int x)
{
    drzewo[tree_siz/2+ind] = x;
    upd((tree_siz/2+ind+1)/2);
}

vector<pii> graph[500002];
int ans[500003];
int l_border[500002];
int r_border[500002];
pii edges[500002];
vi starts_list[500002];
int depth[500002];
int cur_pre = 0;
int pre[500002];
int max_pre[500002];
pii jump[500002][19];
int pop_edge[500002];

vector<pair<int,pii>> del_list[500002];
multiset<int> min_val[500002];

pii lca(int a, int b)
{
    int ans = 0;
    if(depth[a] < depth[b]) swap(a,b);
    for(int bit = 18; bit >= 0; bit--)
    {
        if(depth[jump[a][bit].ff] >= depth[b])
        {
            ans = max(ans,jump[a][bit].ss);
            a = jump[a][bit].ff;
        }
    }
    if(a == b) return {ans,a};
    for(int bit = 18; bit >= 0; bit--)
    {
        if(jump[a][bit].ff != jump[b][bit].ff)
        {
            ans = max(ans,jump[a][bit].ss);
            ans = max(ans,jump[b][bit].ss);
            a = jump[a][bit].ff;
            b = jump[b][bit].ff;
        }
    }
    ans = max(ans,jump[a][0].ss);
    ans = max(ans,jump[b][0].ss);
    return {ans,jump[a][0].ff};
}

void dfs(int v, int pop, int e, int dep = 0)
{
    pop_edge[v] = e;
    pre[v] = cur_pre++;
    max_pre[v] = pre[v];
    jump[v][0] = {pop, l_border[e]+1};
    depth[v] = dep++;
    forall(it,graph[v])
    {
        if(it.ff != pop)
        {
            dfs(it.ff,v,it.ss,dep);
            max_pre[v] = max_pre[it.ff];
        }
    }
}

void upd_path(int v)
{
    if(siz(min_val[v]) == 0)
    {
        change(pre[v],1e9);
    }
    else
    {
        change(pre[v],*min_val[v].begin());
    }
}

void dfs_path(int v, int pop)
{
    forall(it,graph[v])
    {
        if(it.ff != pop)
        {
            dfs_path(it.ff,v);
        }
    }
    forall(it,del_list[v])
    {
        min_val[it.ss.ff].erase(min_val[it.ss.ff].find(it.ff));
        min_val[it.ss.ss].erase(min_val[it.ss.ss].find(it.ff));
        upd_path(it.ss.ff);
        upd_path(it.ss.ss);
    }
    upd_path(v);
    //cout << v << " v\n";
    //cout << get_min(1,0,tree_siz/2,pre[v]+1,max_pre[v]) << " new_min\n";
    r_border[pop_edge[v]] = min(r_border[pop_edge[v]],get_min(1,0,tree_siz/2,pre[v],max_pre[v]));
}

void solve()
{
    int n,m;
    cin >> n >> m;
    rep(i,m) ans[i] = -1;
    rep2(i,1,n) graph[i] = {};
    rep2(i,1,n) del_list[i] = {};
    rep2(i,1,n) min_val[i] = {};
    rep(i,m)
    {
        int a,b,l,r;
        cin >> a >> b >> l >> r;
        if(i < n-1)
        {
            graph[a].pb({b,i});
            graph[b].pb({a,i});
        }
        edges[i] = {a,b};
        l_border[i] = l;
        r_border[i] = r;
    }
    cur_pre = 0;
    dfs(1,1,m);
    rep2(bit,1,18)
    {
        rep2(i,1,n)
        {
            jump[i][bit].ff = jump[jump[i][bit-1].ff][bit-1].ff;
            jump[i][bit].ss = max(jump[i][bit-1].ss,jump[jump[i][bit-1].ff][bit-1].ss);
        }
    }
    rep2(i,n-1,m-1)
    {
        pii l = lca(edges[i].ff,edges[i].ss);
       // cout << edges[i].ff << " " << edges[i].ss << " " << l.ff << " " << l.ss << " edge\n";
        l_border[i] = max(l_border[i],l.ff);
        min_val[edges[i].ff].insert(r_border[i]-1);
        min_val[edges[i].ss].insert(r_border[i]-1);
        del_list[l.ss].pb({r_border[i]-1,{edges[i].ff,edges[i].ss}});
    }
    dfs_path(1,1);
    rep(i,n)
    {
        change(i,1e9);
    }
    rep(i,m)
    {
        if(l_border[i] > r_border[i])
        {
            cout << "xd2\n";
            return;
        }
    }
    rep(i,m)
    {
        starts_list[l_border[i]].pb(i);
    }
    set<pii> s;
    rep2(i,1,m)
    {
        forall(it,starts_list[i])
        {
            s.insert({r_border[it],it});
        }
        if(siz(s) != 0)
        {
            auto it = s.begin();
            while((*it).ff < i)
            {
                s.erase(it);
                if(siz(s) == 0) break;
                it = s.begin();
            }
            if(siz(s) != 0)
            {
                int v = (*it).ss;
                s.erase(it);
                ans[v] = i;
            }
        }
    }
    rep2(i,1,m) starts_list[i] = {};
    rep(i,m)
    {
        if(ans[i] == -1)
        {
            cout << "xd1\n";
            return;
        }
    }
    cout << "YES\n";
    rep(i,m)
    {
        cout << ans[i] << " ";
    }
    cout << "\n";
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    rep(i,tree_siz) drzewo[i] = 1e9;
    //random_start();
    int t = 1;
    cin >> t;
    while(t--) solve();
}