#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
const long long INFll = 1ll * 1000000000 * 1000000000;
const long double PI =
    3.141592653589793238462643383279502884197169399375105820974944;
int mul(int a, int b, int mod = 1000003) { return int(a * 1ll * b % mod); }
int norm(int a, int mod = 1000003) {
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
  return a;
}
int powmod(int x, int y, int mod = 1000003) {
  int res = 1;
  while (y > 0) {
    if (y & 1) res = mul(res, x, mod);
    x = mul(x, x, mod);
    y = y >> 1;
  }
  return res;
}
int inv(int a, int mod = 1000003) { return powmod(a, mod - 2); }
int n, k, r, cnt;
vector<int> c(200005), a(200005);
vector<pair<int, int> > v[200005];
map<pair<int, int>, int> pos;
void dfs(int u, int p, int clr) {
  int assign = 0, flag = 0;
  for (auto e : v[u]) {
    if (e.first != p) {
      assign++;
      if (assign == r + 1 && flag == 0) {
        flag = 1;
        cnt++;
        assign = 1;
      } else if (assign == r + 1) {
        assign = 1;
      }
      if (assign == clr && flag == 0) {
        assign++;
        if (assign == r + 1) {
          flag = 1;
          cnt++;
          assign = 1;
        }
      }
      c[e.second] = assign;
      dfs(e.first, u, assign);
    }
  }
}
void check() {
  cnt = 0;
  dfs(1, 1, 0);
}
int main() {
  fast();
  cin >> n >> k;
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    v[x].push_back(make_pair(y, i));
    v[y].push_back(make_pair(x, i));
  }
  vector<int> sz;
  for (int i = 1; i <= n; i++) {
    sz.push_back(v[i].size());
  }
  sort(sz.rbegin(), sz.rend());
  r = sz[k];
  check();
  cout << r << '\n';
  for (int i = 0; i < n - 1; i++) {
    cout << c[i] << ' ';
  }
  return 0;
}
