#include <bits/stdc++.h>
#include <atcoder/dsu>
using namespace std;
template <class F> class y_combinator {
    F f;

   public:
    y_combinator(F&& f) : f(std::forward<F>(f)) {}
    template <class... Args> auto operator()(Args&&... args) const { return f(*this, std::forward<Args>(args)...); }
};
using ll = long long;
using ld = long double;
template <class T, class U = std::less<T>> using prique = std::priority_queue<T, std::vector<T>, U>;
template <class T> T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); }
template <class T> T ceil(T a, T b) noexcept { return floor(a + b - 1, b); }
template <class T> bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); }
template <class T> bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); }
#define overload4(a, b, c, d, e, ...) e
#define rep1(a) for (long long _i = 0; _i < (a); _i++)
#define rep2(i, a) for (long long i = 0; i < (a); i++)
#define rep3(i, a, b) for (long long i = (a); i < (b); i++)
#define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c))
#define all(x) std::begin(x), std::end(x)
#define rall(x) std::rbegin(x), std::rend(x)
#define pb push_back
#ifndef LOCAL
#define debug(...)
#endif

void run_case() {
    int N, M;
    cin >> N >> M;
    vector<pair<int, int>> E;
    rep(i, M) {
        int a, b;
        cin >> a >> b;
        a--, b--;
        E.pb({a, b});
    }
    int Q;
    cin >> Q;
    vector<int> B(Q);
    rep(i, Q) cin >> B[i], B[i]--;
    atcoder::dsu uf(N);
    vector<vector<int>> G(N);
    rep(i, N) G[i].pb(i);
    vector<ll> ans(Q);
    vector<int> vis(M);
    rep(i, Q) vis[B[i]] = 1;
    rep(i, M) if (!vis[i]) {
        auto [a, b] = E[i];
        int la = uf.leader(a), lb = uf.leader(b);
        if (la != lb) {
            int p = uf.merge(la, lb);
            int q = la ^ lb ^ p;
            for (auto d : G[q]) {
                G[p].pb(d);
            }
            G[q].clear();
        }
    }
    ll cur = ll(N) * (N - 1) / 2;
    rep(i, N) cur -= (ll)G[i].size() * (G[i].size() - 1) / 2;
    debug(cur);
    rrep(it, Q - 1, -1, -1) {
        auto [a, b] = E[B[it]];
        int la = uf.leader(a), lb = uf.leader(b);
        ans[it] = cur;
        if (la != lb) {
            int p = uf.merge(la, lb);
            int q = la ^ lb ^ p;
            cur += (ll)G[p].size() * (G[p].size() - 1) / 2;
            cur += (ll)G[q].size() * (G[q].size() - 1) / 2;
            for (auto d : G[q]) {
                G[p].pb(d);
            }

            G[q].clear();
            cur -= (ll)G[p].size() * (G[p].size() - 1) / 2;
        }
    }
    rep(i, Q) cout << ans[i] << "\n";
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::fixed(std::cout).precision(16);
    int T = 1;
    // cin >> T;
    while (T--) run_case();
    return 0;
}