#include <bits/stdc++.h>
const long long mod = 1000000007;
using namespace std;
void yn(bool a) {
  if (a)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
int pow(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    b /= 2;
    a = (a * a) % mod;
  }
  return ans;
}
bool isPrime(int n) {
  for (int i = 2; i < sqrt(n) + 1; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
bool isCyclicUtil(long long v, bool visited[], bool *recStack,
                  unordered_map<long long, list<long long> > &adjList) {
  if (visited[v] == false) {
    visited[v] = true;
    recStack[v] = true;
    for (auto i : adjList[v]) {
      if (!visited[i] && isCyclicUtil(i, visited, recStack, adjList))
        return true;
      else if (recStack[i])
        return true;
    }
  }
  recStack[v] = false;
  return false;
}
bool isCyclic(long long n,
              unordered_map<long long, list<long long> > &adjList) {
  bool *visited = new bool[n + 1];
  bool *recStack = new bool[n + 1];
  for (int i = 0; i < n + 1; i++) {
    visited[i] = false;
    recStack[i] = false;
  }
  for (long long i = 1; i <= n; i++)
    if (isCyclicUtil(i, visited, recStack, adjList)) return true;
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int test;
  cin >> test;
  while (test--) {
    long long n, m;
    cin >> n >> m;
    unordered_map<long long, list<long long> > adjList;
    vector<long long> indegree(n + 1, 0);
    vector<pair<long long, long long> > undirected;
    for (int i = 0; i < m; i++) {
      long long t, x, y;
      cin >> t >> x >> y;
      if (t == 1) {
        adjList[x].push_back(y);
        indegree[y]++;
      } else {
        undirected.push_back({x, y});
      }
    }
    stack<long long> st;
    for (int i = 1; i < n + 1; i++) {
      if (indegree[i] == 0) st.push(i);
    }
    if (st.empty()) {
      yn(0);
      continue;
    }
    vector<long long> make_pair(n + 1, -1);
    long long p = 0;
    while (!st.empty()) {
      long long top = st.top();
      st.pop();
      make_pair[top] = p++;
      for (auto i : adjList[top]) {
        indegree[i]--;
        if (indegree[i] == 0) st.push(i);
      }
    }
    for (auto i : undirected) {
      if (make_pair[i.first] < make_pair[i.second]) {
        adjList[i.first].push_back(i.second);
      } else {
        adjList[i.second].push_back(i.first);
      }
    }
    if (isCyclic(n, adjList)) {
      yn(0);
      continue;
    }
    yn(1);
    for (auto i : adjList) {
      for (auto j : i.second) {
        cout << i.first << " " << j << endl;
      }
    }
  }
}
