#include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353;
const long double error = 2e-6;
const long double PI = acosl(-1);
mt19937 rng((unsigned)chrono::system_clock::now().time_since_epoch().count());
inline long long int MOD(long long int x, long long int m = mod) {
  long long int y = x % m;
  return (y >= 0) ? y : y + m;
}
const int inf = 1e9;
const long long int infl = 1061109567;
const int nmax = 2e5 + 10;
vector<int> adj[nmax];
pair<int, int> best[nmax][4];
int depth[nmax];
void dfs1(int root, int par) {
  depth[root] = (par == -1) ? 1 : depth[par] + 1;
  best[root][1] = best[root][2] = best[root][3] = {0, root};
  for (int u : adj[root]) {
    if (u == par) continue;
    dfs1(u, root);
    best[root][0] = {best[u][3].first + 1, u};
    sort(best[root], best[root] + 4);
  }
  return;
}
void dfs2(int root, int par) {
  if (par != -1) {
    if (best[par][3].second == root)
      best[root][0] = {best[par][2].first + 1, par};
    else
      best[root][0] = {best[par][3].first + 1, par};
    sort(best[root], best[root] + 4);
  }
  for (int u : adj[root]) {
    if (u == par) continue;
    dfs2(u, root);
  }
  return;
}
int ans[nmax];
void dfs3(int root, int par, int del, int k) {
  ans[root] = ans[par] + del;
  if (ans[root] > k) ans[root] = 1;
  if (ans[root] < 1) ans[root] = k;
  for (int u : adj[root]) {
    if (u == par) continue;
    dfs3(u, root, del, k);
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n, k;
  cin >> n >> k;
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dfs1(1, -1);
  if (k == 2) {
    cout << "YES" << endl;
    for (int i = 1; i <= n; i++) {
      cout << depth[i] % 2 + 1 << " ";
    }
    return 0;
  }
  dfs2(1, -1);
  for (int i = 1; i <= n; i++) {
    if (best[i][1].first == 0) continue;
    if (best[i][1].first + best[i][2].first >= k - 1) {
      cout << "NO" << endl;
      return 0;
    }
  }
  int diamend = 1;
  for (int i = 1; i <= n; i++) {
    if (best[i][3].first > best[diamend][3].first) diamend = i;
  }
  int cur = diamend, dlen = best[diamend][3].first + 1;
  vector<int> diameter;
  set<int> st;
  while (true) {
    ans[cur] = diameter.size() % k + 1;
    st.insert(cur);
    diameter.push_back(cur);
    if (diameter.size() > 1 && diameter.end()[-2] == best[cur][3].second)
      cur = best[cur][2].second;
    else
      cur = best[cur][3].second;
    if (cur == diameter.back()) break;
  }
  assert(st.size() == dlen);
  for (int i = 0; i < diameter.size(); i++) {
    int u = diameter[i];
    int del = 0;
    if (i < diameter.size() / 2)
      del = -1;
    else
      del = 1;
    for (int v : adj[u]) {
      if (ans[v]) continue;
      dfs3(v, u, del, k);
    }
  }
  cout << "YES" << endl;
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
