#include <bits/stdc++.h>
using namespace std;
const long double EPS = (long double)1e-7;
const long double PI = acos(0) * 2;
bool isZero(const long double& x) { return abs(x) <= EPS; }
int sign(const long double& x) { return isZero(x) ? 0 : (0 < x ? 1 : -1); }
long long gcd(long long a, long long b) {
  for (; b; a %= b, swap(a, b)) {
  }
  return abs(a);
}
pair<long long, long long> operator+(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first + b.first, a.second + b.second);
}
pair<long long, long long> operator-(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first - b.first, a.second - b.second);
}
pair<long long, long long> operator*(const pair<long long, long long>& a,
                                     const long long& b) {
  return pair<long long, long long>(a.first * b, a.second * b);
}
long long operator*(const pair<long long, long long>& a,
                    const pair<long long, long long>& b) {
  return a.first * b.second - b.first * a.second;
}
long long ccw(const pair<long long, long long>& a,
              const pair<long long, long long>& b,
              const pair<long long, long long>& c) {
  return a * b + b * c + c * a;
}
void fg(vector<int> G[], int a, int b) {
  G[a].push_back(b);
  G[b].push_back(a);
}
void fg(vector<pair<int, int> > G[], int a, int b, int c) {
  G[a].push_back({b, c});
  G[b].push_back({a, c});
}
const int MAXN = 200055;
vector<int> G[MAXN];
int dep[MAXN], dh[MAXN], dl[MAXN];
bitset<MAXN> chk;
int Ans[MAXN];
int N, K, Rt;
void f(int i, int c, int dc) {
  chk[i] = true;
  Ans[i] = c;
  c += dc;
  if (c < 0) c += K;
  if (K <= c) c -= K;
  for (int v : G[i])
    if (!chk[v]) f(v, c, dc);
}
void dfs(int i) {
  chk[i] = true;
  dh[i] = 1;
  for (int v : G[i])
    if (!chk[v]) {
      dep[v] = dep[i] + 1;
      dfs(v);
      (dh[i]) = max((dh[i]), (dh[v] + 1));
    }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> K;
  for (int i = 1, a, b; i < N; i++) {
    cin >> a >> b;
    fg(G, a, b);
  }
  dep[1] = 1;
  dfs(1);
  Rt = int(max_element(dep + 1, dep + N + 1) - dep);
  chk.reset();
  dep[Rt] = 1;
  dfs(Rt);
  int LI = int(max_element(dep + 1, dep + N + 1) - dep);
  {
    chk.reset();
    vector<int> V;
    V.emplace_back(LI);
    for (int v; !V.empty();) {
      v = V.back();
      V.pop_back();
      chk[v] = true;
      for (int i : G[v])
        if (!chk[i]) {
          chk[i] = true;
          dl[i] = dl[v] + 1;
        }
    }
  }
  if (K > 2) {
    for (int i = 1; i <= N; i++) {
      vector<int> V;
      for (int v : G[i]) {
        if (dep[v] < dep[i]) {
          V.emplace_back(max(dep[i] - 1, dl[i]));
          continue;
        }
        V.emplace_back(dh[v]);
      }
      sort(((V).begin()), ((V).end()));
      reverse(((V).begin()), ((V).end()));
      if (((int)(V).size()) < 3) continue;
      if (min({V[0] + V[1], V[0] + V[2], V[1] + V[2]}) + 1 >= K) {
        puts("No");
        exit(0);
      }
    }
  }
  vector<int> Path;
  for (int i = LI;;) {
    Path.emplace_back(i);
    int nxt = -1;
    for (int v : G[i])
      if (dep[v] < dep[i]) nxt = v;
    if (nxt < 0) break;
    i = nxt;
  }
  chk.reset();
  int CA = Path[((int)(Path).size()) / 2],
      CB = Path[((int)(Path).size()) / 2 - 1];
  G[CA].erase(find(((G[CA]).begin()), ((G[CA]).end()), CB));
  G[CB].erase(find(((G[CB]).begin()), ((G[CB]).end()), CA));
  f(CA, K - 1, -1);
  f(CB, 0, 1);
  puts("Yes");
  for (int i = 1; i <= N; i++) printf("%d ", Ans[i] + 1);
  puts("");
  return 0;
}
