#include <bits/stdc++.h>

typedef long long ll;
typedef long double ld;

#define pb push_back
#define rs resize
#define X first
#define Y second

#define vi vector<int>
#define vvi vector<vector<int> >
#define vpii vector<pair<int, int> >
#define all(x) x.begin(), x.end()

using namespace std;

void read(){
    freopen("pudge.in", "r", stdin);
    freopen("pudge.out", "w", stdout);
}
void faster(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int MAXN = 500010;
vi p(MAXN), s(MAXN), a(MAXN);

int f(int x){
    if (p[x] == x)
        return x;
    return p[x] = f(p[x]);
}

void kek(int x, int y){
    x = f(x), y = f(y);
    if (s[x] < s[y])
        swap(x, y);
    if (x != y)
        p[y] = x, s[x] += s[y];
}

void pudge(){
    int n, m, k, x, y, cur;
    cin >> n >> m;
    vi is_bad(m + 1, 0);
    for (int i = 1; i <= n; i++)
        p[i] = i, s[i] = 1;
    vpii g;
    for (int i = 1; i <= m; i++){
        cin >> x >> y;
        g.pb({x, y});
    }
    vi que, ans;
    cin >> k;
    cur = n;
    for (int i = 1; i <= k; i++){
        cin >> x;
        que.pb(x);
        is_bad[x] = 1;
    }
    for (int i = 1; i <= m; i++){
        if (!is_bad[i]){
            x = g[i - 1].X, y = g[i - 1].Y;
            if (f(x) != f(y))
                cur--;
            kek(x, y);
        }
    }
    reverse(all(que));
    for (int i = 0; i < k; i++){
        ans.pb(cur);
        x = g[i].X, y = g[i].Y;
        if (f(x) != f(y)){
            cur--;
        }
        kek(x, y);
    }
    reverse(all(ans));
    for (int i : ans)
        cout << i << " ";
}

int main(){

    read();

    faster();

    pudge();

    return 0;
}

/*
4 4
1 2
2 3
1 3
3 4
3
2 4 3

1 2 3

3 1
1 2
1
1

1
*/