#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int N = 200005;
const int INF = 0x3f3f3f3f;
struct DSU {
    vector<int> p, sz;
    DSU(int n) : p(n, -1), sz(n, 1) {
        iota(p.begin(), p.end(), 0);
    }
    int find(int x) {
        if (x == p[x]) return x;
        return p[x] = find(p[x]);
    }
    ll unite(int a, int b) {
        a = find(a);
        b = find(b);
        if (a == b) return 0;
        if (sz[a] < sz[b]) swap(a, b);
        ll res = 1ll * sz[a] * sz[b];
        p[b] = a;
        sz[a] += sz[b];
        return res;
    }
};
bool vis[N];
int B[N];
ll ans[N];
int main() {
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> e;
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        e.push_back({u, v});
    }
    int _;
    cin >> _;
    for (int i = 0; i < _; i++) {
        cin >> B[i];
        B[i]--;
        vis[B[i]] = 1;
    }
    DSU dsu(n);
    ll sum = 0;
    for (int i = 0; i < m; i++) {
        if (!vis[i]) sum += dsu.unite(e[i].first, e[i].second);
    }
    ans[_ - 1] = 1ll * n * (n - 1) / 2 - sum;
    for (int i = _ - 1; i >= 1; i--) {
        sum += dsu.unite(e[B[i]].first, e[B[i]].second);
        ans[i - 1] = 1ll * n * (n - 1) / 2 - sum;
    }
    for (int i = 0; i < _; i++) cout << ans[i] << "\n";
    return 0;
}