#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(char ch) {
  string s;
  s += ch;
  return s;
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
void dfs(int n, int p, int curcol, int col, vector<int> &degree,
         vector<int> &ans, vector<vector<pair<int, int> > > &edges) {
  int tempcol = 1;
  for (auto &it : edges[n]) {
    if (it.first != p) {
      while (tempcol == curcol and degree[n] <= col) {
        tempcol += 1;
        if (tempcol > col) {
          tempcol = 1;
        }
      }
      ans[it.second] = tempcol;
      42;
      dfs(it.first, n, tempcol, col, degree, ans, edges);
      tempcol++;
      if (tempcol > col) {
        tempcol = 1;
      }
    }
  }
}
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> ans(n + 1), degree(n + 1);
  vector<vector<pair<int, int> > > edges(n + 1);
  for (int i = 1; i <= n - 1; i++) {
    int u, v;
    cin >> u >> v;
    degree[u]++;
    degree[v]++;
    edges[u].push_back({v, i});
    edges[v].push_back({u, i});
  }
  vector<int> degcnt(n + 1);
  for (int i = 1; i <= n; i++) {
    degcnt[degree[i]]++;
  }
  vector<int> cumsum(n + 1);
  for (int i = 1; i <= n; i++) {
    cumsum[i] = cumsum[i - 1] + degcnt[i];
  }
  int col = 0;
  for (int i = 1; i <= n; i++) {
    if (n - cumsum[i] <= k) {
      col = i;
      break;
    }
  }
  dfs(1, 1, -1, col, degree, ans, edges);
  cout << col << endl;
  for (int i = 1; i <= n - 1; i++) {
    cout << ans[i] << " ";
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
