#include <bits/stdc++.h>
using namespace std;
long long spf[11];
long long fac[11];
void sieve() {
  spf[1] = 1;
  for (long long i = 2; i < 11; i++) spf[i] = i;
  for (long long i = 4; i < 11; i += 2) spf[i] = 2;
  for (long long i = 3; i * i < 11; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 11; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
map<long long, long long> getfactor(long long a) {
  map<long long, long long> m;
  while (a > 1) {
    m[spf[a]]++;
    a /= spf[a];
  }
  return m;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0 || y < 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long inverse(long long a, long long p) { return power(a, p - 2, p); }
long long ncr(long long n, long long r, long long p) {
  if (r > n) return 0;
  if (r == 0 || r == n) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
vector<long long> v[200001];
long long check[200001], degree[200001], t = 0;
bool vis[200001], cycle = 0;
map<long long, long long> ma;
void dfs(long long cur) {
  vis[cur] = 1;
  check[cur] = 1;
  for (auto it : v[cur]) {
    if (vis[it] == 0)
      dfs(it);
    else if (check[it] == 1 && vis[it] == 1) {
      cycle = 1;
      return;
    }
  }
  check[cur] = 0;
  ma[cur] = t;
  t++;
}
void solve() {
  long long n, m;
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) {
    v[i].clear();
    check[i] = 0, degree[i] = 0, vis[i] = 0, check[i] = 0;
  }
  vector<pair<long long, long long> > v1;
  vector<pair<long long, long long> > v2;
  t = 0, cycle = 0;
  for (long long i = 1; i <= m; i++) {
    long long t, x, y;
    cin >> t >> x >> y;
    if (!t)
      v1.push_back(make_pair(x, y));
    else {
      v[x].push_back(y);
      v2.push_back(make_pair(x, y));
    }
  }
  for (long long i = 1; i <= n; i++) {
    if (vis[i] == 0) dfs(i);
  }
  if (cycle) {
    cout << "NO" << '\n';
    return;
  } else {
    cout << "YES" << '\n';
    for (auto it : v1) {
      if (ma[it.first] > ma[it.second])
        cout << it.first << " " << it.second << '\n';
      else
        cout << it.second << " " << it.first << '\n';
    }
    for (auto it : v2) cout << it.first << " " << it.second << '\n';
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long test = 1;
  cin >> test;
  while (test--) {
    solve();
  }
}
