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

vector <vector <int>> v;
vector <int> dist;
vector <char> used;
int cnt[2];

void dfs2() {

}

void dfs1(int node, int length, int prev_node) {
    dist[node] = length;
    used[node] = 1;
    for (int i = 0; i < v[node].size(); i++)
    {
        if (used[i] != 1) {
            dfs(v[node][i], length + 1, node);
        }
    }
}

void task1() {
    int n, x;
    cin >> n >> x;
    v.resize(n+1);
    dist.resize(n+1);
    used.resize(n+1);
    cin >> n >> x;
    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    dfs1(1, 0, 0);
    used.assign(n, 0);

}

int main() {
    task1();
    return 0;
}