from math import comb

class UnionFind:
    def __init__(self,n):
        self.n = n
        self.parent_size = [-1]*n
 
    def leader(self,a):
        if self.parent_size[a] < 0:
            return a
        self.parent_size[a] = self.leader(self.parent_size[a])
        return self.parent_size[a]
 
    def merge(self,a,b):
        x, y = self.leader(a), self.leader(b)
        if x == y:
            return 
        if abs(self.parent_size[x]) < abs(self.parent_size[y]):
            x, y = y, x
        self.parent_size[x] += self.parent_size[y]
        self.parent_size[y] = x
        return 
 
    def same(self,a,b):
        return self.leader(a) == self.leader(b)
 
    def size(self,a):
        return abs(self.parent_size[self.leader(a)])
 
    def groups(self):
        result = [[] for _ in range(self.n)]
        for i in range(self.n):
            result[self.leader(i)].append(i)
        return [r for r in result if r != []]

N, M = map(int, input().split())
edge = [list(map(int, input().split())) for _ in range(M)]
Q = int(input())
query = [int(input()) for _ in range(Q)]

S = set(query)
UF = UnionFind(N)
SUM = comb(N, 2)
for i, (u, v) in enumerate(edge):
    u, v = u-1, v-1
    if i+1 not in S and not UF.same(u, v):
        SUM -= UF.size(u)*UF.size(v)
        UF.merge(u, v)

ans = [SUM]
for i in reversed(range(1, Q)):
    u, v = edge[query[i]-1]
    u, v = u-1, v-1
    if not UF.same(u, v):
        SUM -= UF.size(u)*UF.size(v)
        UF.merge(u, v)
    ans.append(SUM)

print(*ans[::-1], sep="\n")