#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e5+5,inf=0x3f3f3f3f;
struct edge{int to,next,flow;}edge[M];
int n,m,s,t,num,sum,flow,maxflow;
int a[M],dis[M],head[M],Head[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
void addedge(int u,int v,int w){edge[++num]={v,head[u],w};head[u]=num;}
void link(int u,int v,int w){addedge(u,v,w);addedge(v,u,0);}
bool bfs(){
	for (int i=1;i<=t;i++) Head[i]=head[i],dis[i]=-1;
	queue<int>q;q.emplace(t);dis[t]=0;
	while (!q.empty()){
		int x=q.front();q.pop();
		for (int i=head[x],y;i;i=edge[i].next)
			if (edge[i^1].flow&&!~dis[y=edge[i].to])
				dis[y]=dis[x]+1,q.emplace(y);
	}
	return ~dis[s];
}
int dfs(int x,int flow){
	if (x==t) return flow; int used=0,tmp;
	for (int &i=Head[x],y;i;i=edge[i].next){
		if (!edge[i].flow||dis[y=edge[i].to]+1!=dis[x]) continue;
		if (tmp=dfs(y,min(flow-used,edge[i].flow))){
			edge[i].flow-=tmp;edge[i^1].flow+=tmp;
			if ((used+=tmp)==flow) break;
		}
	} return used;
}
void solve(){ num=1;
	n=read();m=read();s=n<<1|1;t=s+1;
	for (int i=1;i<=t;i++) head[i]=0;
	for (int i=1;i<=n;i++) a[i]=read();
	for (int i=1;i<=m;i++){
		int x=read(),y=read();
		link(y,x+n,1);a[y]--;
	} sum=maxflow=0;
	for (int i=1;i<=n;i++){
		if (a[i]>0) link(i+n,t,a[i]);
		else link(s,i,-a[i]),sum-=a[i];
		link(i+n,i,inf);
	}
	while (bfs()) while (flow=dfs(s,inf)) maxflow+=flow;
	printf("%d\n",sum-maxflow);
	for (int i=1;i<=m;i++)
		putchar(!edge[i<<1].flow+'0');
	puts("");
}
int main(){int T=read();while (T--) solve();return 0;}