#[allow(unused_imports)]
use std::io::Write;
use std::collections::HashMap;

// {{{
#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}


macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// }}}

fn main() {
    input! {
        n: usize,
        k: usize,
        l: usize,
        road: [(usize, usize); k],
        train: [(usize, usize); l],
    }

    let mut road_uf = UnionFind::new(n);
    let mut train_uf = UnionFind::new(n);

    for &(c1, c2) in road.iter() {
        road_uf.unite(c1 - 1, c2 - 1);
    }
    for &(c1, c2) in train.iter() {
        train_uf.unite(c1 - 1, c2 - 1);
    }

    let mut count = HashMap::new();
    for i in 0..n {
        let c1 = count.entry((road_uf.find(i), train_uf.find(i))).or_insert(0);
        *c1 += 1;
    }

    let mut ans = vec![];
    for i in 0..n {
        match count.get(&(road_uf.find(i), train_uf.find(i))) {
            Some(a) => ans.push(*a),
            None => ans.push(1),
        }
    }

    println!("{}", ans.iter().map(|x| x.to_string()).collect::<Vec<String>>().join(" "));
}

struct UnionFind {
    parent: Vec<usize>,
    rank: Vec<usize>,
}

impl UnionFind {
    fn new(n: usize) -> UnionFind {
        let mut parent = vec![];
        for i in 0..n {
            parent.push(i);
        }
        UnionFind {
            parent: parent,
            rank: vec![0; n],
        }
    }

    fn find(&mut self, i: usize) -> usize {
        if self.parent[i] == i {
            i
        } else {
            let p1 = self.parent[i];
            self.parent[i] = self.find(p1);
            self.parent[i]
        }
    }

    fn unite(&mut self, i: usize, j: usize) {
        let i = self.find(i);
        let j = self.find(j);
        if i == j {
            return;
        }

        if self.rank[i] < self.rank[j] {
            self.parent[i] = j;
        } else {
            self.parent[j] = i;
            if self.rank[i] == self.rank[j] {
                self.rank[i] += 1;
            }
        }
    }

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


Measured memory_bytes: 36552