use std::io::{ self, Write };
use std::str::FromStr;
use std::cmp::{ min, max };
use std::collections::{ BinaryHeap, VecDeque };

macro_rules! trace {
    ($var:expr) => ({
        let _ = writeln!(&mut std::io::stderr(), ">>> {} = {:?}", stringify!($var), $var);
    })
}
macro_rules! swap { ($a:expr, $b:expr) => ({ let t = $b; $b = $a; $a = t; }) }

fn main() {
    let mut sc = Scanner::new();
    let n: usize = sc.cin();
    let m: usize = sc.cin();
    let q: usize = sc.cin();

    let mut neigh = vec![ vec![]; n];
    let mut connected = vec![vec![false; n]; n];
    let mut queries = vec![];
    let mut ans = vec![q as i32; n];
    let mut reachable = vec![false; n];

    for i in 0..m {
        let a = sc.cin::<usize>() - 1;
        let b = sc.cin::<usize>() - 1;
        connected[a][b] = true;
        connected[b][a] = true;
        neigh[a].push(b);
        neigh[b].push(a);
    }

    {
        let mut stack = vec![0];
        while let Some(u) = stack.pop() {
            if reachable[u] { continue }
            reachable[u] = true;
            for &v in neigh[u].iter() {
                stack.push(v);
            }
        }
        for i in 0..n {
            if ! reachable[i] { ans[i] = 0 }
        }
    }

    for j in 0..q {
        let a = sc.cin::<usize>() - 1;
        let b = sc.cin::<usize>() - 1;
        connected[a][b] = false;
        connected[b][a] = false;
        queries.push((a, b));
    }

    {
        for i in 0..n { reachable[i] = false }
        let mut stack = vec![0];
        while let Some(u) = stack.pop() {
            if reachable[u] { continue }
            reachable[u] = true;
            for &v in neigh[u].iter() {
                if connected[u][v] && ! reachable[v] {
                    stack.push(v)
                }
            }
        }
        for i in 0..n {
            if reachable[i] { ans[i] = -1 }
        }
    }

    for j in (0..q).rev() {

        let (a, b) = queries[j];
        connected[a][b] = true;
        connected[b][a] = true;

        let mut stack = vec![];
        if reachable[a] && ! reachable[b] {
            stack.push(b)
        } else if ! reachable[a] && reachable[b] {
            stack.push(a)
        }

        while let Some(u) = stack.pop() {
            if reachable[u] { continue }
            reachable[u] = true;
            ans[u] = j as i32 + 1;
            for &v in neigh[u].iter() {
                if connected[u][v] && ! reachable[v] {
                    stack.push(v)
                }
            }
        }
    }

    for i in 1..n { println!("{}", ans[i]); }
}

#[allow(dead_code)]
struct Scanner { stdin: io::Stdin, buffer: VecDeque<String>, }
#[allow(dead_code)]
impl Scanner {
    fn new() -> Scanner { Scanner { stdin: io::stdin(), buffer: VecDeque::new() } }
    fn reserve(&mut self) {
        while self.buffer.len() == 0 {
            let mut line = String::new();
            let _ = self.stdin.read_line(&mut line);
            for w in line.split_whitespace() {
                self.buffer.push_back(String::from(w));
            }
        }
    }
    fn cin<T: FromStr>(&mut self) -> T {
        self.reserve();
        match self.buffer.pop_front().unwrap().parse::<T>() {
            Ok(a) => a,
            Err(_) => panic!("parse err")
        }
    }
    fn get_char(&mut self) -> char {
        self.reserve();
        let head = self.buffer[0].chars().nth(0).unwrap();
        let tail = String::from( &self.buffer[0][1..] );
        if tail.len()>0 { self.buffer[0]=tail } else { self.buffer.pop_front(); }
        head
    }
}