#include<bits/stdc++.h>#define INF 0x3f3f3f3f#define d(x) cout << (x) << endl#pragma GCC diagnostic error "-std=c++11"
using namespace std;typedeflonglong ll;constint mod =1e9+7;constint N =1e4+10;int n, m, q;int co =0;int cnt =0;//集合数
vector<int> v[N];//城市关系用邻接表表示int pre[N];int city[N];int ans[N];
bool vis[N];//还没加入的城市置为1intfind(int x){return pre[x]==x?x:pre[x]=find(pre[x]);}voidinit()//最开始要询问的城市都不加入,此时的集合数为最后一个结果。{for(int i =1; i <= n; i++){if(!vis[i]){for(auto x : v[i]){if(!vis[x]){
pre[find(x)]=find(i);}}}}for(int i =1; i <= n; i++){if(!vis[i]&&find(i)== i)
cnt++;}
ans[co++]= cnt;}intmain(){scanf("%d%d",&n,&m);int x, y;for(int i =0; i < m; i++){scanf("%d%d",&x,&y);
v[x].push_back(y);
v[y].push_back(x);}for(int i =1; i <= n; i++){
pre[i]= i;}scanf("%d",&q);for(int i =0; i < q; i++){scanf("%d",&city[i]);
vis[city[i]]=1;}init();for(int i = q -1; i >0; i--){
vis[city[i]]=0;
cnt++;//每次都有一座城市进来for(auto x : v[city[i]]){if(!vis[x]&&find(x)!=find(city[i])){
cnt--;//两个集合并在一起,就少了一个集合
pre[find(x)]=find(city[i]);}}
ans[co++]= cnt;}for(int i = co -1; i >=0; i--){//最后一个输出回车printf("%d%c", ans[i]," \n"[i ==0]);}return0;}