#include <bits/stdc++.h>
#pragma 03
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long INF = 1e18;
long long max_down[200005], max_up[200005];
long long dist[200005][2];
long long color[200005];
long long par[200005];
vector<long long> adj[200005];
bool vis[200005];
long long n, k;
vector<long long> diam;
void dfs1(long long u, long long p) {
  for (auto v : adj[u]) {
    if (v == p) continue;
    dfs1(v, u);
    max_down[u] = max(max_down[u], max_down[v] + 1);
  }
}
void dfs2(long long u, long long p) {
  long long mx[3] = {-INF, -INF, -INF};
  for (auto v : adj[u]) {
    if (v == p) {
      for (long long i = 0; i < 3; i++) {
        if (mx[i] < max_up[u]) {
          for (long long j = 2; j > i; j--) mx[j] = mx[j - 1];
          mx[i] = max_up[u];
          break;
        }
      }
    } else {
      for (long long i = 0; i < 3; i++) {
        if (mx[i] < max_down[v] + 1) {
          for (long long j = 2; j > i; j--) mx[j] = mx[j - 1];
          mx[i] = max_down[v] + 1;
          break;
        }
      }
    }
  }
  for (auto v : adj[u]) {
    if (v == p) continue;
    if (max_down[v] + 1 == mx[0])
      max_up[v] = max(max_up[v], mx[1] + 1);
    else
      max_up[v] = max(max_up[v], mx[0] + 1);
    dfs2(v, u);
  }
  if (mx[1] + mx[2] >= k - 1) {
    cout << "No\n";
    exit(0);
  }
}
void dfs3(long long u, long long p) {
  for (auto v : adj[u]) {
    if (v == p) continue;
    dist[v][0] = dist[u][0] + 1;
    dfs3(v, u);
  }
}
void dfs4(long long u, long long p) {
  par[u] = p;
  for (auto v : adj[u]) {
    if (v == p) continue;
    dist[v][1] = dist[u][1] + 1;
    dfs4(v, u);
  }
}
void bfs1() {
  queue<long long> q;
  for (long long i = 0; i < (long long)diam.size() / 2; i++) {
    color[diam[i]] = (i % k) + 1;
    q.push(diam[i]);
  }
  while (!q.empty()) {
    long long u = q.front();
    q.pop();
    for (auto v : adj[u]) {
      if (vis[v]) continue;
      vis[v] = 1;
      color[v] = color[u] - 1;
      if (color[v] == 0) color[v] = k;
      q.push(v);
    }
  }
}
void bfs2() {
  queue<long long> q;
  for (long long i = (long long)diam.size() / 2; i < (long long)diam.size();
       i++) {
    color[diam[i]] = (i % k) + 1;
    q.push(diam[i]);
  }
  while (!q.empty()) {
    long long u = q.front();
    q.pop();
    for (auto v : adj[u]) {
      if (vis[v]) continue;
      vis[v] = 1;
      color[v] = color[u] + 1;
      if (color[v] == k + 1) color[v] = 1;
      q.push(v);
    }
  }
}
void dfs_solve_2(long long u, long long p) {
  for (auto v : adj[u]) {
    if (v == p) continue;
    color[v] = 3 - color[u];
    dfs_solve_2(v, u);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (long long i = 1; i < n; i++) {
    long long u, v;
    cin >> u >> v;
    adj[u].emplace_back(v);
    adj[v].emplace_back(u);
  }
  if (k == 2) {
    cout << "Yes\n";
    color[1] = 1;
    dfs_solve_2(1, 0);
    for (long long i = 1; i <= n; i++) cout << color[i] << " ";
    cout << "\n";
    return 0;
  }
  dfs1(1, 0);
  dfs2(1, 0);
  cout << "Yes\n";
  dfs3(1, 0);
  long long mx = -1, mx_id = -1;
  for (long long i = 1; i <= n; i++) {
    if (mx < dist[i][0]) {
      mx = dist[i][0];
      mx_id = i;
    }
  }
  dfs4(mx_id, 0);
  mx = mx_id = -1;
  for (long long i = 1; i <= n; i++) {
    if (mx < dist[i][1]) {
      mx = dist[i][1];
      mx_id = i;
    }
  }
  while (1) {
    diam.emplace_back(mx_id);
    mx_id = par[mx_id];
    if (mx_id == 0) break;
  }
  for (auto u : diam) vis[u] = 1;
  bfs1();
  bfs2();
  for (long long i = 1; i <= n; i++) cout << color[i] << " ";
  cout << "\n";
}
