using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
using Enu = System.Linq.Enumerable;

public class Program
{
    static readonly long Big = (long)1e9;

    public void Solve()
    {
        int N = Reader.Int(), M = Reader.Int(), Q = Reader.Int();
        var EdgeId = new Dictionary<long, int>();
        var E = new int[M][];
        var RemovedEdge = new int[Q][];
        var Removed = new bool[M];

        for (int i = 0; i < M; i++)
        {
            int a = Reader.Int() - 1, b = Reader.Int() - 1;
            E[i] = new[] { a, b };
            EdgeId[a * Big + b] = i;
        }
        for (int i = 0; i < Q; i++)
        {
            int a = Reader.Int() - 1, b = Reader.Int() - 1;
            RemovedEdge[i] = new[] { a, b };
            Removed[EdgeId[a * Big + b]] = true;
        }

        var ans = new int[N];
        var comp = new HashSet<int>[N];
        var VtoComp = new int[N];
        for (int i = 0; i < N; i++)
        {
            comp[i] = new HashSet<int>(new[] { i });
            VtoComp[i] = i;
        }

        Action<int, int, int> Unite = (a, b, time) =>
        {
            int ca = VtoComp[a], cb = VtoComp[b];
            if (ca == cb) return;
            if (comp[ca].Count < comp[cb].Count)
                Swap(ref ca, ref cb);
            if (comp[cb].Contains(0))
                foreach (int v in comp[ca])
                    ans[v] = time;
            var zero = comp[ca].Contains(0);
            foreach (int v in comp[cb])
            {
                comp[ca].Add(v);
                VtoComp[v] = ca;
                if (zero) ans[v] = time;
            }
        };
        for (int i = 0; i < M; i++)
            if (!Removed[i])
                Unite(E[i][0], E[i][1], Q + 1);
        for (int i = Q - 1; i >= 0; i--)
            Unite(RemovedEdge[i][0], RemovedEdge[i][1], i + 1);

        ans.Skip(1).ToList().ForEach(a => Console.WriteLine(a == Q + 1 ? -1 : a));
    }

    static void Swap<T>(ref T a, ref T b) { T t = a; a = b; b = t; }
}

class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    static string[] Split(string s) { return s.Split(separator, op); }
    static T[] Range<T>(int N, Func<T> f) { var r = new T[N]; for (int i = 0; i < N; r[i++] = f()) ; return r; }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}