#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#define F first
#define S second
#define bs(A,x) binary_search(all(A),x)
#define lb(A,x) (ll)(lower_bound(all(A),x)-A.begin())
#define ub(A,x) (ll)(upper_bound(all(A),x)-A.begin())
#define cou(A,x) (ll)upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll N,M;cin>>N>>M;
  vm A(N);cin>>A;
  vector<vector<pl>>E(N),F(N);
  rep(i,0,M){
  	ll u,v;cin>>u>>v;u--;v--;
  	E[u].emplace_back(pl(v,i));
  	E[v].emplace_back(pl(u,i));
  }
  vl D(N,-1);
  vector<vector<pl>>C(N);
  function<void(ll)>dfs=[&](ll v){
  	for(auto[u,i]:E[v])if(D[u]==-1){
  		C[v].emplace_back(pl(u,i));
  		F[u].emplace_back(pl(v,i));
  		F[v].emplace_back(pl(u,i));
  		D[u]=1-D[v];
  		dfs(u);
  	}
  };
  D[0]=0;
  dfs(0);
  vm ans(M);
  ll odd=-1,v1,v2;
  rep(i,0,N)for(auto[j,_]:E[i])if(D[i]==D[j])odd=_,v1=i,v2=j;
  if(odd==-1){
  	function<void(ll)>dfs2=[&](ll v){
  		for(auto[u,i]:C[v]){
  			dfs2(u);
  			ans[i]+=A[u];
  			A[v]-=A[u];
  			A[u]=0;
  		}
  	};
  	dfs2(0);
  	if(A[0]==mint(0))cout<<ans<<endl;
  	else cout<<-1<<endl;
  }
  else{
  	vb seen(N);
  	vl P(N),idx(N);
  	function<void(ll)>dfs2=[&](ll v){
  		seen[v]=1;
		for(auto[u,i]:F[v])if(!seen[u]){
  			dfs2(u);
  			ans[i]+=A[u];
  			A[v]-=A[u];
  			A[u]=0;
  			P[u]=v;
  			idx[u]=i;
  		}
  	};
  	dfs2(v1);
  	vl V;
  	ll x=v2;
  	vector<mint>Q={A[v1]};
  	vl R={odd};
  	while(x!=v1){
  		Q.emplace_back(A[x]);
  		R.emplace_back(idx[x]);
  		x=P[x];
  	}
  	ll L=sz(Q);
  	vm S(L+1),T(L+1);
  	rrep(i,0,L)T[i]=Q[i]-T[i+1];
  	rep(i,0,L)S[i+1]=Q[i]-S[i];
  	rep(i,0,L)ans[R[i]]+=(S[i+1]+T[i+1])/2;
  	cout<<ans<<endl;
  }
  return 0;
}