#include <bits/stdc++.h>
using namespace std;
const int maxn = 300000 + 50;
const int maxm = 1300000 + 100;
const int maxt = 3000000 + 100;
const int maxk = 10 + 3;
const int M = 2010;
const long long unit = 1LL;
const int INF = 0x3f3f3f3f;
const long long Inf = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-8;
const double inf = 1e15;
const double pi = acos(-1.0);
const long long mod = 998244353LL, gg = 3LL, inv2 = 499122177LL;
inline long long read() {
  long long x = 0;
  bool t = false;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') t = true, ch = getchar();
  while (ch <= '9' && ch >= '0') x = x * 10 + ch - 48, ch = getchar();
  return t ? -x : x;
}
int n, k, tt;
vector<int> G[maxn], tmp;
int on[maxn], dep[maxn], pre[maxn], dia[maxn], ans[maxn];
void dfs(int u, int fa) {
  for (auto v : G[u]) {
    if (v == fa) continue;
    pre[v] = u;
    dep[v] = dep[u] + 1;
    dfs(v, u);
  }
}
void dfs2(int u, int fa) {
  for (auto v : G[u]) {
    if (v == fa || on[v]) continue;
    tmp.push_back(v);
    dep[v] = dep[u] + 1;
    dfs2(v, u);
  }
}
int main() {
  n = read(), k = read();
  int u, v;
  for (int i = 1; i < n; ++i) {
    u = read(), v = read();
    G[u].push_back(v), G[v].push_back(u);
  }
  dep[1] = 1;
  dfs(1, 0);
  if (k == 2) {
    printf("Yes\n");
    for (int i = 1; i <= n; ++i) printf("%d ", (dep[i] % 2) + 1);
    return 0;
  }
  int p = max_element(dep + 1, dep + 1 + n) - dep;
  memset(dep, 0, sizeof(dep));
  memset(pre, 0, sizeof(pre));
  pre[p] = 0, dep[p] = 1;
  dfs(p, 0);
  int q = max_element(dep + 1, dep + 1 + n) - dep;
  while (q != p) {
    on[q] = 1;
    dia[++tt] = q;
    q = pre[q];
  }
  dia[++tt] = p;
  on[p] = 1;
  int st = 0;
  for (int i = 1; i <= tt; ++i) {
    ans[dia[i]] = st;
    ++st;
    if (st >= k) st -= k;
  }
  memset(dep, 0, sizeof(dep));
  bool ok = true;
  for (int i = 1; i <= tt; ++i) {
    tmp.clear();
    dep[dia[i]] = 0;
    dfs2(dia[i], 0);
    if (tmp.empty()) continue;
    int Max = 0;
    for (auto x : tmp) Max = max(Max, dep[x]);
    if ((i + Max >= k) && (tt - i + 1 + Max >= k)) {
      ok = false;
      break;
    }
    if (tt - i + 1 + Max >= k)
      for (auto x : tmp) ans[x] = ans[dia[i - dep[x]]];
    else
      for (auto x : tmp) ans[x] = ans[dia[i + dep[x]]];
  }
  if (!ok)
    printf("No\n");
  else {
    printf("Yes\n");
    for (int i = 1; i <= n; ++i) printf("%d ", ans[i] + 1);
  }
  return 0;
}
