/// cezar
#include <iostream>
#include <fstream>
#include <queue>
#include <algorithm>

#define NMax 10005
#define pb push_back

using namespace std;

ifstream f("cezar.in");
ofstream g("cezar.out");

int n, k;
int sol = 0;
int m;
vector<int> V[NMax];
vector<int> F;

struct cmp {
    bool operator () (int a, int b) {
        return (F[a] > F[b]);
    }
};

priority_queue<int, vector<int>, cmp> q;

void read() {
    f>>n>>k;
    for (int i=1;i<n;i++) {
        int a, b;
        f>>a>>b;
        V[a].pb(b);
        V[b].pb(a);
    }
}

void solve() {
    m = n-k-1;
    F = vector<int>(n+1, 1);
    for (int i=1;i<=n;i++) {
        if (V[i].size() == 1)
            q.push(i);
    }

    for(int i=1;i<=m;i++) {
        int node = q.top();
        q.pop();

    for(;;);
    }
}

int main() {

    read();
    solve();
    g<<sol<<'\n';

    f.close(); g.close();
    return 0;
}