#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    int n, m;
    cin >> n >> m;
    vector<pair<int, int>> es;
    rep(i, m) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        es.emplace_back(u, v);
    }

    int q;
    cin >> q;
    vector<int> b(q);
    cin >> b;
    rep(i, q) b[i]--;

    vector<bool> rem(m, true);
    rep(i, q) rem[b[i]] = false;

    dsu uf(n);
    ll res = n * ll(n-1) / 2;
    auto merge = [&](int i, int j) {
        if(uf.same(i, j)) return;
        res -= uf.size(i) * ll(uf.size(j));
        uf.merge(i, j);
    };
    rep(i, m) if(rem[i]) {
        auto[pi, pj] = es[i];
        merge(pi, pj);
    }

    vector<ll> ans(q);
    repd(qi, q, 0) {
        ans[qi] = res;
        auto[pi, pj] = es[b[qi]];
        merge(pi, pj);
    }
    rep(i, q) cout << ans[i] << '\n';
    return 0;
}