#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>u(m), v(m);
	vector<bool>chk(m, true);
	rep(i, m) {
		cin >> u[i] >> v[i];
		u[i]--, v[i]--;
	}
	dsu uf(n);
	int q; cin >> q;
	vector<int>b(q);
	rep(i, q) {
		cin >> b[i];
		b[i]--;
		chk[b[i]] = false;
	}
	rep(i, m)if (chk[i]) {
		uf.merge(u[i], v[i]);
	}
	long long tmp = 0;// 連結
	{
		auto gs = uf.groups();
		for (auto g : gs) {
			long long sz = g.size();
			tmp += sz * (sz - 1) / 2;
		}
	}
	vector<long long>ans(q);
	rrep(i, q) {
		ans[i] = ((long long)n) *(n - 1) / 2 - tmp;
		int x = u[b[i]];
		int y = v[b[i]];
		if (!uf.same(x, y)) {
			long long sx = uf.size(x);
			long long sy = uf.size(y);
			tmp -= sx * (sx - 1) / 2;
			tmp -= sy * (sy - 1) / 2;
			uf.merge(x, y);
			sx += sy;
			tmp += sx * (sx - 1) / 2;
		}
	}
	rep(i, q)cout << ans[i] << endl;
	return 0;
}