#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
vector<int> g[N];
int ans[N], p[N], par[N];
int find(int v) { return (p[v] < 0) ? v : (p[v] = find(p[v])); }
bool combine(int u, int v) {
  u = find(u);
  v = find(v);
  if (u == v) {
    return false;
  }
  if (p[u] > p[v]) {
    swap(u, v);
  }
  p[u] += p[v];
  p[v] = u;
  return true;
}
int dfs(int u, int x) {
  par[u] = x;
  if (x && g[u].size() == 3) return u;
  for (int v : g[u]) {
    if (v != x) {
      int y = dfs(v, u);
      if (y != -1) return y;
    }
  }
  return -1;
}
void get(int u, int x, vector<int> &vec) {
  vec.push_back(u);
  for (int v : g[u]) {
    if (v != x) get(v, u, vec);
  }
}
bool check(int n, int m, int k) {
  n++;
  m++;
  k++;
  return n * m + m * k + k * n <= n * m * k;
}
void print(int n) {
  cout << "YES" << '\n';
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << " ";
  }
  cout << '\n';
}
void solve() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    g[i].clear();
    par[i] = 0;
    ans[i] = 0;
    p[i] = -1;
  }
  int root = -1;
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
    if (!combine(u, v)) root = u;
  }
  if (root != -1) {
    root = find(root);
    for (int i = 1; i <= n; i++) {
      if (find(i) == root) ans[i] = 1;
    }
    print(n);
    return;
  }
  vector<int> vec;
  for (int i = 1; i <= n; i++) {
    if (g[i].size() > 3) {
      for (auto x : g[i]) {
        ans[x] = 1;
      }
      ans[i] = 2;
      print(n);
      return;
    }
    if (g[i].size() == 3) {
      vec.push_back(i);
    }
  }
  if (vec.empty()) {
    cout << "NO" << '\n';
    return;
  }
  for (auto x : vec) {
    int u = dfs(x, 0);
    if (u != -1) {
      for (auto v : g[u]) {
        ans[v] = 1;
      }
      for (auto v : g[x]) {
        ans[v] = 1;
      }
      while (u != 0) {
        ans[u] = 2;
        u = par[u];
      }
      print(n);
      return;
    }
    vector<vector<int> > a(3);
    vector<int> sz(3);
    for (int i = 0; i < 3; i++) {
      get(g[x][i], x, a[i]);
      while (a[i].size() > 6) {
        a[i].pop_back();
      }
      sz[i] = a[i].size();
    }
    if (!check(sz[0], sz[1], sz[2])) continue;
    for (int i = 0; i < 3; i++) {
      int uwu =
          2 * (sz[0] + 1) * (sz[1] + 1) * (sz[2] + 1) * sz[i] / (sz[i] + 1);
      int dif = 2 * (sz[0] + 1) * (sz[1] + 1) * (sz[2] + 1) / (sz[i] + 1);
      ans[x] += uwu;
      for (auto y : a[i]) {
        ans[y] = uwu;
        uwu -= dif;
      }
    }
    ans[x] /= 2;
    print(n);
    return;
  }
  cout << "NO" << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
