#include<fstream>
#include<vector>

using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");

int n, m, compcon; 
bool visited[100001];
vector <int> vertex[100001];

void dfs(int current)
{
  int next, i;
  visited[current] = true;

  for(i=0; i<vertex[current].size(); i++)
  {
    next = vertex[current][i];
    if(!visited[next])
      dfs(next);
  }
}

int main()
{
  int i, x, y;
  in>>n>>m;
  for(i=1; i<=m; i++)
  {
    in>>x>>y;
    vertex[x].push_back(y);
    vertex[y].push_back(x);
  }
  
  for(i=1; i<=m; i++)
    if(visited[i]) dfs(i);
    else compcon++;

  out<<compcon;
  return 0;
}