#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <cmath>


using namespace std;


typedef long long ll;
typedef long double ld;


const ll MOD_CONST = 1000000007ll;


ll modSum(ll a, ll b, ll MOD = MOD_CONST) {
  return ((a % MOD) + (b % MOD)) % MOD;
}


ll modSubtract(ll a, ll b, ll MOD = MOD_CONST) {
  return (((a % MOD) - (b % MOD)) + MOD + MOD) % MOD;
}


ll modProd(ll a, ll b, ll MOD = MOD_CONST) {
  return ((a % MOD) * (b % MOD)) % MOD;
}


ll getPowMod(ll x, ll e, ll MOD = MOD_CONST) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    ll tmp = getPowMod(x, e/2, MOD);
    return modProd(tmp, tmp);
  } else {
    ll tmp = getPowMod(x, e-1, MOD);
    return modProd(tmp, x);
  }
}


ll getPow(ll x, ll e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    ll tmp = getPow(x, e/2);
    return tmp * tmp;
  } else {
    ll tmp = getPow(x, e-1);
    return tmp * x;
  }
}


ll getInverse(ll x, ll MOD = MOD_CONST) {
  return getPowMod(x, MOD-2, MOD);
}


bool isEven(ll x) {
  ll tmp = ((x % 2) + 2) % 2;
  return tmp == 0;
}


ll getSumOfDigitsInBase(ll n, ll b) {
  ll ret = 0;
  while (n > 0) {
    ret += n % b;
    n /= b;
  }
  return ret;
}


vector<int> getKMP(string &s) {
  int len = (int)s.size();
  vector<int> ret (len, 0);
  for (int i = 1 ; i < len ; i++) {
    int at = ret[i-1];
    while (at > 0 && s[i] != s[at]) {
      at = ret[at-1];
    }
    if (s[i] == s[at]) {
      at++;
    }
    ret[i] = at;
  }
  return ret;
}


string getSubstring(string &s, int from, int to) {
  int l = to-from+1;
  if (l <= 0) {
    return "";
  }
  return s.substr(from, l);
}

ll gcd(ll a, ll b, ll & x, ll & y) {
    if (a == 0) {
        x = 0;
        y = 1;
        return b;
    }
    ll x1, y1;
    ll d = gcd(b % a, a, x1, y1);
    x = y1 - (b / a) * x1;
    y = x1;
    return d;
}


pair<ll, ll> getIntersectingRange(ll a1, ll b1, ll a2, ll b2) {
  ll s = max(a1, a2);
  ll e = min(b1, b2);

  return {s, e};
}


bool isNonEmptyIntersection(ll a1, ll b1, ll a2, ll b2) {
  auto p = getIntersectingRange(a1, b1, a2, b2);
  return p.first <= p.second;
}


double getPointDistance(double x1, double y1, double x2, double y2) {
  double dx = x1-x2;
  double dy = y1-y2;
  double d = (dx * dx) + (dy * dy);
  return sqrt(d);
}















const int MAXN = 200001;


int N, K, L, totC1, totC2;
int cc1[MAXN], cc2[MAXN];
map< pair<int, int>, int> freq;
vector<int> G1[MAXN], G2[MAXN];


void DFS1(int at) {
  cc1[at] = totC1;
  for (int nxt : G1[at]) {
    if (cc1[nxt] == 0) {
      DFS1(nxt);
    }
  }
}


void DFS2(int at) {
  cc2[at] = totC2;
  for (int nxt : G2[at]) {
    if (cc2[nxt] == 0) {
      DFS2(nxt);
    }
  }
}


void input() {
  cin >> N >> K >> L;
  int u, v;
  for (int i = 1 ; i <= K ; i++) {
    cin >> u >> v;
    G1[u].push_back(v);
    G1[v].push_back(u);
  }
  for (int i = 1 ; i <= L ; i++) {
    cin >> u >> v;
    G2[u].push_back(v);
    G2[v].push_back(u);
  }
}


void preprocess() {
}


void solve() {

  for (int i = 1 ; i <= N ; i++) {
    if (cc1[i] == 0) {
      totC1++;
      DFS1(i);
    }
  }
  for (int i = 1 ; i <= N ; i++) {
    if (cc2[i] == 0) {
      totC2++;
      DFS2(i);
    }
  }

  for (int i = 1 ; i <= N ; i++) {
    freq[{cc1[i], cc2[i]}]++;
  }

  for (int i = 1 ; i <= N ; i++) {
    cout << freq[{cc1[i], cc2[i]}] << " ";
  }
}


int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cerr.tie(0);

  int T;
//  cin >> T;
  T = 1;

  for (int i = 0 ; i < T ; i++) {
    input();
    preprocess();
    solve();
  }

  return 0;
}

Measured memory_bytes: 27904