#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
template<class T> inline void fix(T &x) {if(x >= mod | x <= -mod) {x %= mod;} if(x < 0) {x += mod;}}
#define out(x) cout << __LINE__ << ": " << (#x) << " = " << (x) << endl
const ll MAX_N = 1e5 + 10;
set<pair<ll, ll> > g[MAX_N];
ll ans[MAX_N], arr[MAX_N];
struct cmp {
bool operator ()(const ll &a, const ll &b) const {
if(g[a].size() == g[b].size()) {
return a < b;
}
return g[a].size() < g[b].size();
}
};
multiset<ll, cmp> pq;
void removeBranches() {
while(!pq.empty() && g[*(pq.begin())].size() == 1) {
ll curr = *(pq.begin()); pq.erase(pq.begin());
auto other = *(g[curr].begin());
pq.erase(other.first);
ans[other.second] = arr[curr];
arr[other.first] -= arr[curr];
g[other.first].erase({curr, other.second});
pq.insert(other.first);
}
}
signed main() {
//ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
ll n, m;
cin >> n >> m;
if(m > n) {cout << 0 << endl; return 0;}
for(ll i = 1; i <= n; i ++) {
cin >> arr[i];
}
for(ll i = 0; i < m; i ++) {
ll a, b;
cin >> a >> b;
g[a].insert({b, i});
g[b].insert({a, i});
}
for(ll i = 1; i <= n; i ++) {
pq.insert(i);
}
removeBranches();
for(ll i = 0; i < m; i ++) {
cout << ans[i] * 2 << endl;
}
return 0;
}
