#include<bits/stdc++.h>
#define pb push_back
const int INF=1e9;
using namespace std;

const int N=1e5+5;
int he[N],w[N],nxt[N],to[N],cnt,dis[N],cur[N],S,T,n,m,uu[N],vv[N];
void add(int u,int v,int k) {
	to[++cnt]=v,nxt[cnt]=he[u],he[u]=cnt;
	w[cnt]=k;
}
void Add(int u,int v,int k) {
	add(u,v,k),add(v,u,0);
//	printf("%d %d %d\n",u,v,k);
}
queue<int>q;
bool bfs() {
	for(int i=1;i<=T;++i) dis[i]=-1;
	while(!q.empty()) q.pop();
	q.push(S); dis[S]=0; cur[S]=he[S];
	while(!q.empty()) {
		int u=q.front(); q.pop();
		for(int e=he[u];e;e=nxt[e]) {
			int v=to[e];
			if(w[e]&&dis[v]==-1) {
				dis[v]=dis[u]+1;
				cur[v]=he[v];
				if(v==T) return 1;
				q.push(v);
			}
		}
	}
	return 0;
}
int dfs(int x,int f) {
	if(x==T) return f;
	int used=0,t;
	for(int &i=cur[x];i;i=nxt[i]) {
		int v=to[i];
		if(w[i]&&dis[v]==dis[x]+1) {
			t=dfs(v,min(w[i],f));
			w[i]-=t,w[i^1]+=t;
			used+=t; f-=t;
			if(!f) return used;
		}
	}
	if(!used) dis[x]=-1;
	return used;
}
int main() {
//	freopen("1.in","r",stdin);
	int cas; scanf("%d",&cas);
	while(cas--) {
		memset(cur,0,sizeof(cur));
		memset(he,0,sizeof(he));
		cnt=1;
		scanf("%d%d",&n,&m);
		S=n+m+1,T=S+1;
		for(int i=1;i<=n;++i) {
			int x; scanf("%d",&x);
			Add(S,i,x);
		}
		for(int i=1;i<=m;++i) {
			int u,v; scanf("%d%d",&u,&v);
			Add(u,i+n,1);
			Add(v,i+n,1);
			Add(i+n,T,1);
			uu[i]=u,vv[i]=v;
		}
		int ans=0;
		while(bfs()) {
			ans+=dfs(S,INF);
		}
	//	printf("%d\n",ans);
		printf("%d\n",m-ans); 
		for(int i=1;i<=m;++i) {
			bool fl=0;
			for(int e=he[i+n];e;e=nxt[e]) {
				int v=to[e];
				if(v<=n&&w[e]) {
					if(v==uu[i]) fl=1;
				}
			}
			putchar(fl+'0');
		}
		puts(""); 
	}
	return 0;
}