#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const LL LINF = 1e18;
const int INF = 1e9;

struct Graph
{
	struct Edge
	{
		int from, to;
		int cap, flow;
		LL cost;
	};
	int n;
	vector<Edge> edges;
	vector<VI> g;
	vector<LL> d;
	VI p, w;
	
	void init(int _n)
	{
		n = _n;
		edges.clear();
		g.clear();
		g.resize(n);
		d.resize(n);
		p.resize(n);
		w.resize(n);
	}
	void addEdge(int from, int to, int cap, LL cost)
	{
		assert(0 <= from && from < n);
		assert(0 <= to && to < n);
		assert(0 <= cap);
		assert(0 <= cost);
		g[from].PB(SZ(edges));
		edges.PB({from, to, cap, 0, cost});
		g[to].PB(SZ(edges));
		edges.PB({to, from, 0, 0, -cost});
	}
	pair<int, LL> flow(int s, int t)
	{
		assert(0 <= s && s < n);
		assert(0 <= t && t < n);
		assert(s != t);
		
		int flow = 0;
		LL cost = 0;
		while(true)
		{
			fill(ALL(d), LINF);
			fill(ALL(p), -1);
			fill(ALL(w), 0);
			queue<int> q1, q2;
			w[s] = 1;
			d[s] = 0;
			q2.push(s);
			while(!q1.empty() || !q2.empty())
			{
				int v;
				if(!q1.empty())
				{
					v = q1.front();
					q1.pop();
				}
				else
				{
					v = q2.front();
					q2.pop();
				}
				for (int e : g[v])
				{
					if(edges[e].flow == edges[e].cap)
						continue;
					int to = edges[e].to;
					LL newDist = d[v] + edges[e].cost;
					if(newDist < d[to])
					{
						d[to] = newDist;
						p[to] = e;
						if(w[to] == 0)
							q2.push(to);
						else if(w[to] == 2)
							q1.push(to);
						w[to] = 1;
					}
				}
				w[v] = 2;
			}
			
			if(p[t] == -1)
				break;
			int curFlow = INF;
			LL curCost = 0;
			for(int v = t; v != s;)
			{
				int e = p[v];
				curFlow = min(curFlow, edges[e].cap - edges[e].flow);
				curCost += edges[e].cost;
				v = edges[e].from;
			}
			for(int v = t; v != s;)
			{
				int e = p[v];
				edges[e].flow += curFlow;
				edges[e ^ 1].flow -= curFlow;
				v = edges[e].from;
			}
			flow += curFlow;
			cost += curCost * curFlow;
		}
		return {flow, cost};
	}
};



void solve()
{
	int n, m;
	cin >> n >> m;

	Graph G;
	G.init(n + m + 2);
	int s = n + m, t = n + m + 1;

	FOR(i, 0, n)
	{
		int cnt;
		cin >> cnt;
		G.addEdge(m + i, t, cnt, 0);
		G.addEdge(m + i, t, m, 1);
	}

	VI id(m);
	FOR(i, 0, m)
	{
		int a, b;
		cin >> a >> b;
		a--; b--;
	
		G.addEdge(s, i, 1, 0);
		id[i] = SZ(G.edges);
		G.addEdge(i, m + a, 1, 0);
		G.addEdge(i, m + b, 1, 0);		
	}
	auto ans = G.flow(s, t);
	cout << ans.S << "\n";
	
	FOR(i, 0, m)
	{
		int e = id[i];
		cout << (G.edges[e].cap == G.edges[e].flow);
	}
	cout << "\n";
}

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int t;
	cin >> t;
	while(t--)
		solve();
	
	return 0;
}