#include<bits/stdc++.h>
using namespace std;
int n,m,f[500005],size[500005];
vector<int>to[500005];
void dfs(int u,int fa){
    size[u]=1;
    for(int i=0;i<to[u].size();i++){
        int v=to[u][i];
        if(v==fa)continue;
        f[v]=u;
        dfs(v,u);
        size[u]+=size[v];
    }
}
int main(){
    freopen("Decorations.in","r",stdin);
    freopen("Decorations.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i=1;i<n;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        to[u].push_back(v);
        to[v].push_back(u);
    }
    dfs(1,0);
    cout<<1;
    return 0;
}