#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const double PI = 2 * acos(0.0);
bool cycle = 0;
stack<long long int> topo;
vector<long long int> vis;
vector<vector<long long int>> adj;
void dfs(long long int a) {
  for (long long int i = 0; i < adj[a].size(); i++) {
    long long int val = adj[a][i];
    if (vis[val] == 0) {
      vis[val] = 1;
      dfs(val);
      vis[val] = 2;
      topo.push(val);
    } else if (vis[val] == 1) {
      cycle = 1;
      return;
    }
  }
}
void solve() {
  long long int n, a, m, b;
  cin >> n >> m;
  adj.clear();
  vis.clear();
  cycle = 0;
  adj.resize(n + 2);
  vis.resize(n + 2);
  vector<pair<long long int, long long int>> store, store2;
  while (!topo.empty()) {
    topo.pop();
  }
  long long int t, x, y;
  for (long long int i = 0; i < m; i++) {
    cin >> t >> x >> y;
    if (t == 1) {
      adj[x].push_back(y);
      store2.push_back({x, y});
    } else {
      store.push_back({x, y});
    }
  }
  long long int beg = 0;
  vector<long long int> tim(n + 2, 0);
  for (long long int i = 1; i <= n; i++) {
    if (vis[i] == 0) {
      vis[i] = 1;
      dfs(i);
      vis[i] = 2;
      topo.push(i);
      if (cycle == 1) {
        cout << "NO"
             << "\n";
        return;
      }
    }
  }
  while (!topo.empty()) {
    a = topo.top();
    topo.pop();
    beg++;
    tim[a] = beg;
  }
  for (long long int i = 0; i < (long long int)(store.size()); i++) {
    a = store[i].first;
    b = store[i].second;
    if (tim[a] < tim[b]) {
      store2.push_back({a, b});
    } else {
      store2.push_back({b, a});
    }
  }
  cout << "YES"
       << "\n";
  for (auto val : store2) {
    cout << val.first << " " << val.second << "\n";
  }
}
int main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
