#ifndef DEBUG
#  define NDEBUG
#endif
#include <iostream>
#include <string>
#include <iterator>
#include <utility>
#include <type_traits>
#include <limits>
#include <cassert>
#include <vector>
#include <map>

using namespace std;

// template {{{
// misc {{{
using Z = int;
[[maybe_unused]]
constexpr Z INF = numeric_limits<Z>::max() / 3;
// }}}

// debug {{{
template <class T>
using enable_if_sequence_t = enable_if_t<
  is_same<
    typename iterator_traits<
      typename remove_cv_t<remove_reference_t<T>>::iterator
    >::iterator_category,
    random_access_iterator_tag>{}>;
#ifdef NDEBUG
# define dump(x)
# define debug if (0)
template <class T>
inline T&& ix(T&& value) { return value; }
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix(T&& container, Index index, Indices... indices) {
  return ix(container[index], indices...);
}
#else
# define dump(x) do { \
    cerr << "\e[33m[dump: " << __LINE__ << "] " << (#x) << " = " << x << "\e[0m" << endl; \
  } while (0);
# define debug
template <class T>
inline auto&& ix_impl([[maybe_unused]] int line, [[maybe_unused]] const char* code, T&& value) {
  return value;
}
template <class T, class Index, class... Indices, class = enable_if_sequence_t<T>>
inline auto&& ix_impl(int line, const char* code, T&& container, Index index, Indices... indices) {
  if (index < 0) {
    cerr << "\e[31mix: negative index at line " << line << ", ix(" << code << ")\e[0m" << endl;
    exit(1);
  }
  int size = container.size();
  if (index >= size) {
    cerr << "\e[31mix: index out of range at line " << line << ", ix(" << code << ")\n"
      << "index = " << index << " whereas size = " << size << "\e[0m" << endl;
    exit(1);
  }
  return ix_impl(line, code, container[index], indices...);
}
#define ix(...) ix_impl(__LINE__, #__VA_ARGS__, __VA_ARGS__)
#endif
// }}}

// IO {{{
template <class T>
false_type is_container_impl(...);
template <class T, class = typename T::iterator>
true_type is_container_impl(T);
template <class T>
struct is_container : decltype(is_container_impl<T>(declval<T>())) {};
template <>
struct is_container <string> : std::false_type {};
template <class Container, class = enable_if_t<is_container<Container>{}>>
istream& operator>> (istream& is, Container& cont) {
  for (auto& v : cont) is >> v;
  return is;
}
template <class Container, class = enable_if_t<is_container<Container>{}>>
ostream& operator<< (ostream& os, Container const& cont) {
  bool first = true;
  constexpr char sep =
    is_container<typename Container::value_type>{} ? '\n' : ' ';
  for (auto const& v : cont) {
    if (!first) {
      os << sep;
    }
    first = false;
    os << v;
  }
  return os;
}
template <class T, class U>
ostream& operator<< (ostream& os, pair<T, U> p) {
  os << '(' << p.first << ", " << p.second << ')';
  return os;
}
// }}}
// }}}

class union_find {
  private:
    vector<Z> parent, rank, size;
  public:
    union_find(Z n): parent(n), rank(n, 1), size(n, 1) {
      for (auto i = 0; i < n; i++)
        ix(parent, i) = i;
    }

    Z root(Z x) {
      Z& par = ix(parent, x);
      if (par == x) return x;
      return par = root(par);
    }

    void unite(Z x, Z y) {
      x = root(x);
      y = root(y);
      if (x == y) return;
      if (ix(rank, x) > ix(rank, y))
        swap(x, y);
      ix(parent, x) = y;
      ix(size, y) += ix(size, x);
      if (ix(rank, x) == ix(rank, y))
        ix(rank, y)++;
    }

    bool is_same(Z x, Z y) {
      return root(x) == root(y);
    }

    Z group_size(Z x) {
      return ix(size, root(x));
    }
};



int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  Z N, K, L;
  cin >> N >> K >> L;
  union_find road(N), railway(N);
  for (auto i = 0; i < K; i++) {
    Z p, q;
    cin >> p >> q;
    p--; q--;
    road.unite(p, q);
  }
  for (auto i = 0; i < L; i++) {
    Z r, s;
    cin >> r >> s;
    r--; s--;
    railway.unite(r, s);
  }
  map<Z, map<Z, Z>> count;
  for (auto i = 0; i < N; i++)
    count[road.root(i)][railway.root(i)]++;
  vector<Z> ans(N);
  for (auto i = 0; i < N; i++)
    ix(ans, i) = count[road.root(i)][railway.root(i)];
  cout << ans << endl;
}



Measured memory_bytes: 31616