#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e6 + 10;
const int INF = 1e9;
int color[MAXN], vis[MAXN], out[MAXN];
int pai[MAXN];
vector<pair<int, pair<int, int>>> adj[MAXN];
vector<int> nadj[MAXN];
map<pair<int, pair<int, int>>, int> nodes;
bool cycle = false;
vector<int> ans;
int n, m;
int cur_vtx = 0;
void get_cycle(int u, int v){
while(v != u){
if(v < m) ans.push_back(v);
v = pai[v];
}
if(u < m) ans.push_back(u);
reverse(ans.begin(), ans.end());
}
void dfs(int v){
vis[v] = 1;
for(auto u : nadj[v]){
if(!vis[u]){
pai[u] = v;
dfs(u);
} else if(!out[u]){
if(!cycle) get_cycle(u, v);
cycle = true;
}
}
out[v] = 1;
}
void add(int e1, int j, int lx, int rx, int l, int r){
if(rx < l || lx > r) return;
if(l <= lx && rx <= r){
if(!nodes.count({j, {lx, rx}})){
nodes[{j, {lx, rx}}] = cur_vtx;
for(int i=lx; i<=rx; i++) nadj[cur_vtx].push_back(adj[j][i - 1].second.second);
cur_vtx ++;
}
int e2 = nodes[{j, {lx, rx}}];
nadj[e1].push_back(e2);
return;
}
int m = (lx + rx) / 2;
add(e1, j, lx, m, l, r);
add(e1, j, m + 1, rx, l, r);
}
void solve(){
cin >> n >> m;
cycle = false;
ans.clear(); nodes.clear();
for(int i=1; i<=n; i++) adj[i].clear();
for(int i=0; i<cur_vtx; i++){
nadj[i].clear();
vis[i] = out[i] = 0;
}
for(int i=0; i<m; i++){
int a, b; cin >> a >> b >> color[i];
adj[a].push_back({color[i], {b, i}});
}
for(int i=1; i<=n; i++) sort(adj[i].begin(), adj[i].end());
cur_vtx = m;
for(int i=1; i<=n; i++){
for(auto [c, x] : adj[i]){
auto [j, e1] = x;
// agora sei que quero conectar e1 num intervalo de arestas do j
int pos_l = lower_bound(adj[j].begin(), adj[j].end(), make_pair(c, make_pair(0, 0))) - adj[j].begin() - 1;
int pos_r = upper_bound(adj[j].begin(), adj[j].end(), make_pair(c, make_pair(INF, INF))) - adj[j].begin();
int sz = (int) adj[j].size();
// cout << e1 << " has color " << c << endl;
// cout << "sz of " << j << " = " << sz << endl;
// for(auto [c, x] : adj[j]) cout << c << " "; cout << endl;
// cout << "add " << e1 << " in " << 1 << " " << pos_l + 1 << " of " << j << endl;
// cout << "add " << e1 << " in " << pos_r + 1 << " " << sz << " of " << j << endl;
add(e1, j, 1, sz, 1, pos_l + 1);
add(e1, j, 1, sz, pos_r + 1, sz);
}
}
for(int i=0; i<m; i++) if(!vis[i]) dfs(i);
if(!cycle){
cout << "NO\n";
return;
}
cout << "YES\n";
cout << (int) ans.size() << " ";
for(auto i : ans) cout << i + 1 << " ";
cout << "\n";
}
int main(){
cin.tie(0)->sync_with_stdio(0);
int t; cin >> t;
while(t--){
solve();
}
return 0;
}
