#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
  const char *comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
const char nl = '\n';
const int inf = 2e9;
const ll INF = (ll)2e18;
const ll mod = 1e9 + 7;
const int N = 2e5 + 15;
int cycle;
vi g[N];
vi topo, vis;
void dfs(int u) {
  vis[u] = 1;
  for (int v : g[u]) {
    if (vis[v] == 1) {
      cycle = 1;
    }
    if (vis[v] == 0) {
      dfs(v);
    }
  }
  vis[u] = 2;
  topo.push_back(u);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int tc;
  cin >> tc;
  while (tc--) {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) g[i].clear();
    topo.clear();
    vector<pair<int, int>> undir;
    int t, u, v;
    for (int i = 1; i <= m; ++i) {
      cin >> t >> u >> v;
      if (t) {
        g[u].push_back(v);
      } else {
        undir.push_back({u, v});
      }
    }
    vis.assign(n + 1, 0);
    cycle = 0;
    for (u = 1; u <= n; ++u) {
      if (vis[u] == 0) dfs(u);
    }
    if (cycle) {
      cout << "NO\n";
      continue;
    }
    reverse((topo).begin(), (topo).end());
    vi pos(n + 1);
    for (int i = 0; i < n; ++i) {
      pos[topo[i]] = i;
    }
    cout << "YES\n";
    for (P &p : undir) {
      if (pos[p.second] < pos[p.first]) swap(p.first, p.second);
      cout << p.first << " " << p.second << nl;
    }
    for (int i = 1; i <= n; ++i) {
      for (int j : g[i]) {
        cout << i << " " << j << nl;
      }
    }
  }
  return 0;
}
