from sys import stdin

class DSU():

    def __init__(self, n:int):

        self.n = n
        self.p = [i for i in range(n)]
        self.rank = [i for i in range(n)]
        self.sizelis = [1] * n

    def leader(self,a):
        stk = []
        while self.p[a] != a:
            stk.append(a)
            a = self.p[a]
        for v in stk:
            self.p[v] = a
        return a

    def merge(self, a, b):
        ap = self.leader(a)
        bp = self.leader(b)
        if ap == bp:
            return ap

        if self.rank[ap] > self.rank[bp]:
            self.p[bp] = ap
            self.sizelis[ap] += self.sizelis[bp]
        elif self.rank[ap] < self.rank[bp]:
            self.p[ap] = bp
            self.sizelis[bp] += self.sizelis[ap]
        else:
            self.p[bp] = ap
            self.sizelis[ap] += self.sizelis[bp]
            self.rank[ap] += 1
        return self.p[ap]

    def same(self,a,b):
        return self.leader(a) == self.leader(b)

    def size(self,a):
        return self.sizelis[ self.leader(a) ]

    def groups(self):
        dic = {}
        for v in range(self.n):
            vp = self.leader(v)
            if vp not in dic:
                dic[vp] = [v]
            else:
                dic[vp].append(v)
        return list(dic.values())


N,M = map(int,stdin.readline().split())

e = []

for i in range(M):
    u,v = map(int,stdin.readline().split())
    u -= 1
    v -= 1
    e.append( (u,v) )

ans = []

Q = int(stdin.readline())
B = [ int(stdin.readline())-1 for i in range(Q) ]

bset = set(B)

uf = DSU(N)
ans = N*(N-1)//2

for i in range(M):
    u,v = e[i]
    if (i not in bset) and (not uf.same(u,v)):
        c1 = uf.size(u)
        c2 = uf.size(v)
        ans -= c1 * c2
        uf.merge(u,v)

        # print (u+1,v+1,"link. ans=",ans)

ANS = [ans]

for i in reversed(B):
    u,v = e[i]
    if not uf.same(u,v):
        c1 = uf.size(u)
        c2 = uf.size(v)
        ans -= c1 * c2
        uf.merge(u,v)
    ANS.append(ans)

ANS.pop()
ANS.reverse()
print (*ANS,sep="\n")