#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#define FILEIO(filename) (freopen(filename ".in", "r", stdin), freopen(filename ".out", "w", stdout))
typedef long long ll;
typedef unsigned long long ull;
const int N = 500015;
int Test;
int n, m;
struct node
{
    int u, v, l, r, id;
    inline bool operator<(node b) const
    {
        return r == b.r ? id < b.id : r < b.r;
    }
} e[N];
struct Edge
{
    int to, nxt, id;
} E[N << 1];
int head[N], tot;
inline void add(int f, int t, int id)
{
    E[++tot] = {t, head[f], id}, head[f] = tot;
    return;
}
int lg[N], dep[N], fid[N], fa[N][20], mx[N][20];
void dfs(int x, int from, int fw, int fd)
{
    dep[x] = dep[fa[x][0] = from] + 1, mx[x][0] = fw, fid[x] = fd;
    for (int i = 1; i < lg[dep[x]];++i)
        fa[x][i] = fa[fa[x][i - 1]][i - 1], mx[x][i] = std::max(mx[x][i - 1], mx[fa[x][i - 1]][i - 1]);
    for (int i = head[x];i;i = E[i].nxt)
    {
        int y = E[i].to, id = E[i].id;
        if(y == from)
            continue;
        dfs(y, x, e[id].l, id);
    }
    return;
}
inline int getmx(int x, int y)
{
    int res = 0;
    if (dep[x] < dep[y])
        std::swap(x, y);
    while(dep[x] > dep[y])
        res = std::max(res, mx[x][lg[dep[x] - dep[y]] - 1]), x = fa[x][lg[dep[x] - dep[y]] - 1];
    if(x == y)
        return res;
    for (int i = lg[dep[x]] - 1; i >= 0;--i)
        if(fa[x][i] != fa[y][i])
            res = std::max({res, mx[x][i], mx[y][i]}), x = fa[x][i], y = fa[y][i];
    return std::max({res, mx[x][0], mx[y][0]});
}
struct Dsu
{
    int lk[N];
    inline void init(int l)
    {
        for (int i = 0; i <= l;++i)
            lk[i] = i;
        return;
    }
    int find(int x)
    {
        return x == lk[x] ? x : lk[x] = find(lk[x]);
    }
    inline void merge(int x, int y)
    {
        lk[find(x)] = find(y);
        return;
    }
    inline bool same(int x, int y)
    {
        return find(x) == find(y);
    }
} D;
int q[N];
std::set<node> st;
int ans[N];
void solve(void)
{
    scanf("%d%d", &n, &m);
    memset(head, 0, sizeof(int) * (n + 5)), tot = 0;
    memset(fa, 0, sizeof(int) * (n + 5) * 20);
    memset(mx, 0, sizeof(int) * (n + 5) * 20);
    for (int i = 1; i <= m; ++i)
    {
        scanf("%d%d%d%d", &e[i].u, &e[i].v, &e[i].l, &e[i].r), e[i].id = i;
        if(i < n)
            add(e[i].u, e[i].v, i), add(e[i].v, e[i].u, i);
    }
    dfs(1, 0, 0, 0);
    std::sort(e + 1, e + 1 + m, [](node a, node b) -> bool
              { return a.r < b.r; });
    for (int i = 1;i <= m;++i)
        q[e[i].id] = i;
    D.init(n);
    for (int i = 1; i <= m; ++i)
        if(e[i].id >= n)
        {
            e[i].l = std::max(e[i].l, getmx(e[i].u, e[i].v));
            int u = e[i].u, v = e[i].v;
            while(u != v)
            {
                if(dep[u] < dep[v])
                    std::swap(u, v);
                e[q[fid[u]]].r = std::min(e[q[fid[u]]].r, e[i].r);
                D.merge(u, fa[u][0]);
                u = D.find(u);
            }
        }
    std::sort(e + 1, e + 1 + m, [](node a, node b) -> bool
              { return a.l < b.l; });
    for (int i = 1; i <= m;++i)
        if(e[i].l > e[i].r)
        {
            puts("NO");
            return;
        }
    st.clear();
    int pt = 1;
    for (int i = 1; i <= m;++i)
    {
        while(pt <= m && e[pt].l <= i)
            st.insert(e[pt++]);
        if(st.empty())
        {
            puts("NO");
            return;
        }
        node t = *st.begin();
        st.erase(st.begin());
        if(t.r < i)
        {
            puts("NO");
            return;
        }
        ans[t.id] = i;
    }
    puts("YES");
    for (int i = 1; i <= m;++i)
        printf("%d%c", ans[i], " \n"[i == m]);
    return;
}
int main(void)
{
    for (int i = 1; i < N;++i)
        lg[i] = lg[i >> 1] + 1;
    scanf("%d", &Test);
    while(Test--)
        solve();
    return 0;
}