#include <bits/stdc++.h>
using namespace std;

#define For(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, n) For(i, 0, n)
#define rFor(i, a, b) for(int i = (a); i >= (b); i--)
#define ALL(v) (v).begin(), (v).end()
#define rALL(v) (v).rbegin(), (v).rend()
#define SZ(v) ((int)(v).size())

using lint = long long;
using ld = long double;

int INF = 2000000000;
lint LINF = 1000000000000000000;

struct SetupIo {
    SetupIo() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} setupio;

// a <- max(a, b)
template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

// a <- min(a, b)
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

#include <atcoder/dsu>

int main() {
    lint N, M;
    cin >> N >> M;
    vector<int> U(M), V(M);
    rep(i, M) {
        cin >> U[i] >> V[i];
        U[i]--;
        V[i]--;
    }
    int Q;
    cin >> Q;
    vector<int> B(Q);
    rep(i, Q) {
        cin >> B[i];
        B[i]--;
    }

    vector<bool> exist(M, true);
    rep(i, Q) {
        exist[B[i]] = false;
    }

    atcoder::dsu uf(N);
    rep(i, M) {
        if (exist[i]) {
            uf.merge(U[i], V[i]);
        }
    }
    
    lint now = N * (N - 1LL) / 2LL;
    rep(i, N) {
        if (uf.leader(i) == i) {
            lint sz = uf.size(i);
            now -= sz * (sz - 1LL) / 2LL;
        }
    }

    vector<lint> ans;
    ans.emplace_back(now);
    for (int i = Q - 1; i >= 0; i--) {
        int u = U[B[i]], v = V[B[i]];
        if (uf.same(u, v)) {
            ans.emplace_back(now);
        } else {
            lint x = uf.size(u);
            lint y = uf.size(v);
            now -= x * y;
            ans.emplace_back(now);
            uf.merge(u, v);
        }
    }

    reverse(ALL(ans));
    For(i, 1, Q + 1) {
        cout << ans[i] << "\n";
    }
}