#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;

#define LL long long
#define MAXN 100000
#define Pr pair<int,int>
#define Fi first
#define Se second

LL read(){
    LL x=0,F=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')F=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*F;
}

int n,m,cnt1,cnt2,tmp1,tmp2;
int a[MAXN+5],vis[MAXN+5],res;
vector<int> G[MAXN+5];

int main(){
    n=read(),m=read();
    for(int i=1;i<=n;i++){
        a[i]=read();
        if(a[i]==0)cnt1++;
        else cnt2++;
    }
    for(int i=1;i<=m;i++){
        int u=read(),v=read();
        if(a[u]>a[v])swap(u,v);
        if(a[u]==0&&a[v]==1){
            G[u].push_back(v);
            G[v].push_back(u);
            vis[u]=1,vis[v]=1;
        }
    }
    for(int i=1;i<=n;i++)
    if(a[i]==0&&!vis[i])tmp1++;
    else if(a[i]==1&&!vis[i])tmp2++;
    for(int i=1;i<=n;i++){
        if(a[i]==0){
            res=cnt1-1;
            if(G[i].size()==0)
                res+=2*cnt2+tmp2;
            else
                res+=2*cnt2-G[i].size();
        }
        else{
            res=cnt2-1;
            if(G[i].size()==0)
                res+=2*cnt1+tmp1;
            else
                res+=2*cnt1-G[i].size();
        }
        printf("%d%c",res,(i!=n)?' ':'\n');
    }
}