#include <bits/stdc++.h>
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(
      const pair<pair<long long int, long long int>, long long int> &p1,
      const pair<pair<long long int, long long int>, long long int> &p2) const {
    if (p1.second == p2.second) {
      return p1.first.second < p2.first.second;
    }
    return p1.second < p2.second;
  }
};
long long int get_pow(long long int a, long long int b) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
const long long int N = 1e5 + 5, inf = 4e18;
std::vector<vector<long long> > adj(N), adj2(N);
void solve() {
  long long int n, m, x, y;
  cin >> n >> m;
  vector<long long> v(n);
  for (long long int i = (long long int)0; i < (long long int)(n); i++)
    cin >> v[i];
  for (long long int i = (long long int)0; i < (long long int)(m); i++) {
    cin >> x >> y;
    x--;
    y--;
    if (v[y] != 1) {
      adj[x].push_back(y);
      adj2[y].push_back(x);
    }
  }
  vector<bool> go(n, false);
  queue<int> q;
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    if (v[i] == 1) {
      q.push(i);
      go[i] = 1;
    }
  }
  while (!q.empty()) {
    int t = q.front();
    q.pop();
    for (auto x : adj[t])
      if (!go[x]) {
        go[x] = 1;
        q.push(x);
      }
  }
  vector<bool> come(n, false);
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    if (v[i] == 2) {
      q.push(i);
      come[i] = 1;
    }
  }
  while (!q.empty()) {
    int t = q.front();
    q.pop();
    for (auto x : adj2[t])
      if (!come[x]) {
        come[x] = 1;
        q.push(x);
      }
  }
  for (long long int i = (long long int)0; i < (long long int)(n); i++)
    cout << (go[i] && come[i]) << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
