import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] sa = br.readLine().split(" ");
		int n = Integer.parseInt(sa[0]);
		int m = Integer.parseInt(sa[1]);
		int[] u = new int[m];
		int[] v = new int[m];
		for (int i = 0; i < m; i++) {
			sa = br.readLine().split(" ");
			u[i] = Integer.parseInt(sa[0]) - 1;
			v[i] = Integer.parseInt(sa[1]) - 1;
		}
		int q = Integer.parseInt(br.readLine());
		int[] b = new int[q];
		Set<Integer> set = new HashSet<>();
		for (int i = 0; i < q; i++) {
			b[i] = Integer.parseInt(br.readLine()) - 1;
			set.add(b[i]);
		}
		br.close();

		UnionFind uf = new UnionFind(n);
		long val = (long) n * (n - 1) / 2;
		for (int i = 0; i < m; i++) {
			if (!set.contains(i)) {
				int v1 = u[i];
				int v2 = v[i];
				if (!uf.same(v1, v2)) {
					val -= (long) uf.size(v1) * uf.size(v2);
					uf.union(v1, v2);
				}
			}
		}
		long[] ans = new long[q];
		for (int i = q - 1; i >= 0; i--) {
			ans[i] = val;
			int v1 = u[b[i]];
			int v2 = v[b[i]];
			if (!uf.same(v1, v2)) {
				val -= (long) uf.size(v1) * uf.size(v2);
				uf.union(v1, v2);
			}
		}

		PrintWriter pw = new PrintWriter(System.out);
		for (long i : ans) {
			pw.println(i);
		}
		pw.flush();
	}

	static class UnionFind {
		int[] parent, size;
		int num = 0; // 連結成分の数

		UnionFind(int n) {
			parent = new int[n];
			size = new int[n];
			num = n;
			for (int i = 0; i < n; i++) {
				parent[i] = i;
				size[i] = 1;
			}
		}

		void union(int x, int y) {
			int px = find(x);
			int py = find(y);
			if (px != py) {
				parent[px] = py;
				size[py] += size[px];
				num--;
			}
		}

		int find(int x) {
			if (parent[x] == x) {
				return x;
			}
			parent[x] = find(parent[x]);
			return parent[x];
		}

		/**
		 * xとyが同一連結成分か
		 */
		boolean same(int x, int y) {
			return find(x) == find(y);
		}

		/**
		 * xを含む連結成分のサイズ
		 */
		int size(int x) {
			return size[find(x)];
		}
	}
}