1900分图论: 1141G 思维+构造

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

void FileIO()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
}
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int n , k;
const int N = 200005, M = 200005;
int head[N], cnt;
struct node{
    int f , t, next;
}edge[M*4];
vector <int> eg[N];
vector< pair<int,int> > ve;
void add(int f , int t)
{
    edge[cnt].t = t;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
int color[N], ans;
void dfs(int u , int fa, int c)
{
    for (int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        if(fa == v)
            continue;
        c += 1;
        if(c == ans + 1)
            c = 1;
        color[i / 2 + 1] = c;
        dfs(v,u,c);

    }
}
int main(void)
{
    CLOSE;
    mem(head,-1);
    cin >> n >> k;
    for (int i = 1 ; i < n ; i ++)
    {
        int u , v;
        cin >> u >> v;
        eg[u].pb(v);
        eg[v].pb(u);
        add(u,v);
        add(v,u);
    }
    for (int i = 1 ; i <= n ; i ++)
    {
        if(eg[i].size() >= 2)
            ve.pb(mk(eg[i].size(),i));
    }
    sort (ve.begin(), ve.end());
    if(ve.size() <= k)
    {
        cout << 1 << endl;
        for (int i = 1; i <= n-1 ; i ++)
            cout << 1 << ' ';
        cout << endl;
        return 0;
    }
    ans = ve[ve.size() - k - 1].fi;
    cout << ans << endl;
    dfs(1,0,0);
    for (int i = 1 ; i < n ; i ++)
        cout << color[i] << ' ';
    cout << endl;
}