#include <bits/stdc++.h>
using namespace std;

string file = "arbore";
ifstream fin(file + ".in");
ofstream fout(file + ".out");

int n, m;
vector <int> g[100001];
int v[300001], sz, first[100001], last[100001];

void dfs(int node = 1, int p = -1) {

    first[node] = last[node] = ++sz;

    for (auto &i : g[node])
        if (i != p) {

            dfs(i, node);
            last[node] = ++sz;
        }
}

int main() {

    fin >> n >> m;

    for (int i = 1; i < n; i++) {

        int x, y;
        fin >> x >> y;

        g[x].push_back(y);
        g[y].push_back(x);
    }

    dfs();

    if (sz > 300000)
        while (true);

    return 0;
}