#include <bits/stdc++.h>
using namespace std;
const int N = 1002;
class cmp {
 public:
  bool operator()(const pair<long long int, long long int> &a,
                  const pair<long long int, long long int> &b) {
    if (a.second != b.second) return a.second > b.second;
    return a.first > b.first;
  }
};
unordered_map<long long int, long long int> pos;
long long int k;
bool is(vector<long long int> *dir, long long int i, long long int *vis) {
  vis[i] = 1;
  bool flag = false;
  for (auto j : dir[i]) {
    if (vis[j] == 0) {
      flag |= is(dir, j, vis);
    } else if (vis[j] == 1)
      flag = true;
  }
  if (flag == false) vis[i] = 2;
  return flag;
}
void topo(long long int i, vector<long long int> *dir, long long int *vis) {
  vis[i] = 1;
  for (auto j : dir[i]) {
    if (vis[j] == 0) {
      topo(j, dir, vis);
    }
  }
  pos[i] = ++k;
}
void solve() {
  long long int n, m;
  cin >> n >> m;
  vector<long long int> dir[n + 1];
  vector<pair<long long int, long long int> > v;
  vector<pair<long long int, long long int> > v1;
  long long int x, y, z, i;
  for (i = 0; i < m; i++) {
    cin >> x >> y >> z;
    if (x == 1) {
      dir[y].push_back(z);
      v1.push_back({y, z});
    } else if (x == 0) {
      v.push_back({y, z});
    }
  }
  long long int vis[n + 1];
  for (i = 1; i <= n; i++) vis[i] = 0;
  for (i = 1; i <= n; i++) {
    if (vis[i] == 0) {
      if (is(dir, i, vis)) {
        cout << "NO" << endl;
        return;
      }
    }
  }
  k = 0;
  for (i = 1; i <= n; i++) vis[i] = 0;
  for (i = 1; i <= n; i++) {
    if (vis[i] == 0) {
      topo(i, dir, vis);
    }
  }
  cout << "YES" << endl;
  for (auto it : v1) {
    x = it.first;
    y = it.second;
    cout << x << " " << y << endl;
  }
  for (auto it : v) {
    x = it.first;
    y = it.second;
    if (pos[x] > pos[y])
      cout << x << " " << y << endl;
    else
      cout << y << " " << x << endl;
  }
  pos.clear();
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
