#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

fn main() {
    let v = read_vec::<usize>();
    let (n, k, l) = (v[0], v[1], v[2]);

    let mut roads = vec![];
    for _ in 0..k {
        let v = read_vec::<usize>();
        roads.push((v[0] - 1, v[1] - 1));
    }

    let mut trains = vec![];
    for _ in 0..l {
        let v = read_vec::<usize>();
        trains.push((v[0] - 1, v[1] - 1));
    }

    let mut road_uft = UnionFindTree::new(n);
    for &(p, q) in roads.iter() {
        road_uft.unite(p, q);
    }

    let mut train_uft = UnionFindTree::new(n);
    for &(p, q) in trains.iter() {
        train_uft.unite(p, q);
    }

    let mut road_dict = HashMap::new();
    for i in 0..n {
        road_dict
            .entry(road_uft.find(i))
            .or_insert(Vec::new())
            .push(i);
    }
    let mut answers = vec![0; n];
    for v in road_dict.values() {
        let mut count_dict = HashMap::new();
        for i in v {
            let root = train_uft.find(*i);
            *count_dict.entry(root).or_insert(0) += 1;
        }
        for i in v {
            let root = train_uft.find(*i);
            answers[*i] = count_dict[&root];
        }
    }

    print_array(&answers);
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn print_array<T: std::string::ToString>(array: &Vec<T>) {
    println!(
        "{}",
        array
            .iter()
            .map(|ref x| x.to_string())
            .collect::<Vec<_>>()
            .join(" ")
    );
}

#[derive(Debug, Clone)]
struct UnionFindTree {
    parent: Vec<isize>,
    size: Vec<usize>,
    height: Vec<u64>,
}

impl UnionFindTree {
    fn new(n: usize) -> UnionFindTree {
        UnionFindTree {
            parent: vec![-1; n],
            size: vec![1usize; n],
            height: vec![0u64; n],
        }
    }

    fn find(&mut self, index: usize) -> usize {
        if self.parent[index] == -1 {
            return index;
        }
        let idx = self.parent[index] as usize;
        let ret = self.find(idx);
        self.parent[index] = ret as isize;
        ret
    }

    fn same(&mut self, x: usize, y: usize) -> bool {
        self.find(x) == self.find(y)
    }

    fn get_size(&mut self, x: usize) -> usize {
        let idx = self.find(x);
        self.size[idx]
    }

    fn unite(&mut self, index0: usize, index1: usize) -> bool {
        let a = self.find(index0);
        let b = self.find(index1);
        if a == b {
            false
        } else {
            if self.height[a] > self.height[b] {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
            } else if self.height[a] < self.height[b] {
                self.parent[a] = b as isize;
                self.size[b] += self.size[a];
            } else {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
                self.height[a] += 1;
            }
            true
        }
    }
}


Measured memory_bytes: 43576