#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }



const int MAX_UF = 210000;
struct UnionFind {    
    int size_;
    int par[MAX_UF];
    int rank[MAX_UF];
    int weight[MAX_UF];
    
    UnionFind(int n = 0) {size_ = n; for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, weight[i] = 1;}
    void init(int n) {size_ = n; for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, weight[i] = 1;}
    int root(int x) {return par[x] == x ? x : par[x] = root(par[x]);}    
    bool same(int x, int y) {return root(x) == root(y);}
    int get(int x) { return weight[root(x)]; }
    friend ostream& operator << (ostream& s, UnionFind uf) {
        vector<vector<int> > res = uf.group();
        for (int i = 0; i < res.size(); ++i) { s << uf.get(res[i][0]) << ", " << res[i] << endl; }
        return s;
    }
    
    void connect(int x, int y) {
	    x = root(x), y = root(y);
		int sx = weight[x], sy = weight[y];
        if (x == y) return;
		int r;
        if (rank[x] < rank[y]) par[x] = y, r = y;
        else {par[y] = x, r = x; if (rank[x] == rank[y]) ++rank[x];}
	    weight[r] = sx + sy;
    }
    
    vector<vector<int> > group() {
        vector<vector<int> > res;        
        vector<bool> fixed(size_, false);
        for (int i = 0; i < size_; ++i) {
            if (!fixed[i]) {
                vector<int> temp;
                for (int j = i; j < size_; ++j) {
                    if (same(i, j)) temp.push_back(j), fixed[j] = true;
                }
                res.push_back(temp);
            }
        }
        return res;
    }
} ufa, ufb;

int n, k, l;

int main() {
  while (cin >> n >> k >> l) {
	ufa.init(n);
	ufb.init(n);
	for (int i = 0; i < k; ++i) {
	  int a, b;
	  scanf("%d %d", &a, &b);
	  --a, --b;
	  ufa.connect(a, b);
	}
	for (int i = 0; i < l; ++i) {
	  int a, b;
	  scanf("%d %d", &a, &b);
	  --a, --b;
	  ufb.connect(a, b);
	}
      map<pair<int,int>, int> ma;
      for (int v = 0; v < n; ++v) {
          ma[make_pair(ufa.root(v), ufb.root(v))]++;
      }
      for (int v = 0; v < n; ++v) {
          cout << ma[make_pair(ufa.root(v), ufb.root(v))];
          if (v != n-1) cout << " ";
      }
      cout << endl;
  }
}
	  
  


Measured memory_bytes: 16640