# https://yukicoder.me/problems/no/3213s


class UnionFind:
    """
    UnionFindの基本的な処理を実装したクラス
    """

    def __init__(self, size):
        self.root = [i for i in range(size)]
        self.size = [1] * size

    def get_root(self, v):
        if v == self.root[v]:
            return v
        else:
            old_root = self.root[v]
            new_root = self.get_root(old_root)
            self.root[v] = new_root
            return new_root

    def merge(self, u, v):
        root_u = self.get_root(u)
        root_v = self.get_root(v)
        if root_u == root_v:
            return False

        if self.size[root_u] >= self.size[root_v]:
            self.size[root_u] += self.size[root_v]
            self.root[root_v] = root_u
            self.root[v] = root_u
        else:
            self.size[root_v] += self.size[root_u]
            self.root[root_u] = root_v
            self.root[u] = root_v
        return True

def main():
    N, M = map(int, input().split())
    edges = []
    for _ in range(M):
        u, v = map(int, input().split())
        edges.append((u - 1, v - 1))

    Q = int(input())
    B = []
    for _ in range(Q):
        B.append(int(input()) - 1)

    b_set = set(B)
    uf = UnionFind(N)
    for i in range(M):
        if i not in b_set:
            u, v = edges[i]
            uf.merge(u, v)

    r_set = set()
    for i in range(N):
        r_set.add(uf.get_root(i))

    base_answer = 0
    for r in r_set:
        z = uf.size[r]
        base_answer += (z * (z - 1)) // 2

    answer = [0] * Q
    for i in reversed(range(Q)):
        answer[i] = base_answer

        b = B[i]
        u, v = edges[b]
        if uf.get_root(u) != uf.get_root(v):
            size_u = uf.size[uf.get_root(u)]
            size_v = uf.size[uf.get_root(v)]
            total_size = size_u + size_v

            base_answer += (total_size * (total_size - 1)) // 2
            base_answer -= (size_v * (size_v - 1)) // 2
            base_answer -= (size_u * (size_u - 1)) // 2
            uf.merge(u, v)
    
    for i in range(Q):
        ans = (N * (N - 1)) // 2 - answer[i]
        print(ans)








if __name__ == "__main__":
    main()