local UnionFind={} UnionFind.create=function(self,n) self.par={} self.group={} for i=1,n do self.par[i]=i self.group[i]={i} end end UnionFind.getroot=function(self,x) local nx=x while self.par[x]~=x do x=self.par[x] end while self.par[nx]~=x do self.par[nx],nx=x,self.par[nx] end return x end UnionFind.same=function(self,x,y) return self:getroot(x)==self:getroot(y) end UnionFind.unite=function(self,x,y) local rx=self:getroot(x) local ry=self:getroot(y) if rx==ry then return end if #self.group[rx]<#self.group[ry] then rx,ry=ry,rx end for _,v in pairs(self.group[ry]) do self.par[v]=rx table.insert(self.group[rx],v) end self.group[ry]={} end UnionFind.new=function(self,n) local obj={} setmetatable(obj,{__index=UnionFind}) obj:create(n) return obj end ---------- local n,m,q=io.read("*n","*n","*n","*l") local map={} for i=1,m do local edge=io.read() local a,b=edge:match("(%d+) (%d+)") map[edge]={tonumber(a),tonumber(b)} end local event={} local bridge={} for i=1,q do local edge=io.read() local c,d=edge:match("(%d+) (%d+)") event[edge]=true bridge[i]={tonumber(c),tonumber(d)} end local uf=UnionFind:new(n) for edge,vertex in pairs(map) do if not event[edge] then local a,b=vertex[1],vertex[2] uf:unite(a,b) end end local result={} local root=uf.par[1] for _,vertex in pairs(uf.group[root]) do result[vertex]=-1 end for i=q,1,-1 do local c,d=bridge[i][1],bridge[i][2] if not uf:same(c,d) then if uf:same(1,c) or not uf:same(1,d) then local root=uf.par[d] for _,vertex in pairs(uf.group[root]) do result[vertex]=i end elseif not uf:same(1,c) or uf:same(1,d) then local root=uf.par[c] for _,vertex in pairs(uf.group[root]) do result[vertex]=i end end uf:unite(c,d) end end for i=2,n do print(result[i]) end