#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma optimize("SEX_ON_THE_BEACH")
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using dd = double;
using ldd = long double;
using si = short int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
ll get_seed(string s) {
  ll ans = 0;
  for (int i = 0; i < s.size(); ++i) ans += s[i];
  return ans;
}
vector<vector<pair<int, int>>> gr;
vector<int> clr;
int ans;
void ba(int v, int p = -1, int bc = -1) {
  if (gr[v].size() > ans) {
    int c = 1;
    for (pair<int, int> to : gr[v]) {
      if (to.first != p) {
        clr[to.second] = c;
        ba(to.first, v, c);
      }
    }
    return;
  }
  int s = 1;
  for (pair<int, int> to : gr[v]) {
    if (s == bc) ++s;
    s = min(s, ans);
    if (to.first == p) continue;
    clr[to.second] = s;
    ba(to.first, v, s);
    ++s;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cout.tie(0);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  gr.resize(n);
  clr.resize(n);
  vector<int> cnt(n);
  for (int i = 0; i < n - 1; ++i) {
    int x, y;
    cin >> x >> y;
    --x;
    --y;
    cnt[x]++;
    cnt[y]++;
    gr[x].push_back({y, i});
    gr[y].push_back({x, i});
  }
  sort((cnt).begin(), (cnt).end());
  0;
  ;
  for (int i = 1; i <= n; ++i) {
    int ii = upper_bound((cnt).begin(), (cnt).end(), i) - cnt.begin();
    if (n - ii <= k) {
      cout << i;
      ans = i;
      break;
    }
  }
  cout << '\n';
  ba(0);
  for (int i = 0; i < n - 1; ++i) cout << clr[i] << " ";
  return 0;
}
