#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PII;
const ll N=1919810,inf=1e18;
const ll V=2010,E=200010;
int n,m,k,s,t;
int a[N],b[N];
bool tf[314];
template<typename T>
struct MaxFlow
{
    int s, t, vtot;
    int head[V], etot;
    int dis[V], cur[V];
    struct edge
    {
        int v, nxt;
        T f;
    }e[E * 2];
    void addedge(int u, int v, T f)
    {
        e[etot] = {v, head[u], f}; head[u] = etot++;
        e[etot] = {u, head[v], 0}; head[v] = etot++;
    }
    bool bfs()
    {
        for(int i = 1 ; i <= vtot ; i++ )
        {
            dis[i] = 0;
            cur[i] = head[i];
        }
        queue<int> q;
        q.push(s); dis[s] = 1;
        while(!q.empty())
        {
            int u = q.front(); q.pop();
            for(int i = head[u] ; ~i ; i = e[i].nxt)
            {
                if(e[i].f && !dis[e[i].v])
                {
                    int v = e[i].v;
                    dis[v] = dis[u] + 1;
                    if(v == t) return true;
                    q.push(v);
                }
            }
        }
        return false;
    }
    T dfs(int u, T m)
    {
        if(u == t) return m;
        T flow = 0;
        for(int i = cur[u]; ~i ; cur[u] = i = e[i].nxt)
        {
            if(e[i].f && dis[e[i].v] == dis[u] + 1)
            {
                T f = dfs(e[i].v, min(m, e[i].f));
                e[i].f -= f;
                e[i ^ 1].f += f;
                m -= f;
                flow += f;
                if(!m) break;
            }
        }
        if(!flow) dis[u] = -1;
        return flow;
    }
    T dinic()
    {
        T flow = 0;
        while(bfs()) flow += dfs(s, numeric_limits<T>::max());
        return flow;
    }
    void init(int s_, int t_, int vtot_ )
    {
        s = s_;
        t = t_;
        vtot = vtot_;
        etot = 0;
        for(int i = 1 ; i <= vtot ; i++ )
        {
            head[i] = -1;
        }
    } 
};

MaxFlow<ll> g;

// int u[N],v[N];


void __(){
    memset(tf,false,sizeof tf);
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    int s,t,tot;
    tot=n*2+m*2+m*2;
    s=++tot;
    t=++tot;
    g.init(s,t,tot);
    for(int i=1;i<=n;i++){
        g.addedge(i,i+n,a[i]);
        g.addedge(i+n,t,inf);
    }
    for(int i=1;i<=m;i++){
        g.addedge(s,n*2+m*2+i,inf);
        g.addedge(n*2+m*2+i,n*2+m*3+i,1);
    }
    for(int i=1;i<=m;i++){
        int x,y;
        cin>>x>>y;
        g.addedge(n*2+m*3+i,i+2*n,1);
        g.addedge(i+2*n,x,1);
        g.addedge(n*2+m*3+i,i+2*n+m,1);
        g.addedge(i+2*n+m,y,1);
        // u[i]=x,v[i]=y;
    }
    int ans=g.dinic();
    // cout<<ans<<endl;
    printf("%d\n",max(0,m-ans));
    for(int i=1;i<=m;i++){
        int num=n*2+m*3+i,need1=i+2*n,need2=i+2*n+m;
        map<int,int> mp;
        for(int j=g.head[num];~j;j=g.e[j].nxt){
            // cout<<g.e[j].v<<" "<<need1<<" "<<need2<<" "<<g.e[j].f<<endl;
            mp[g.e[j].v]=g.e[j].f;
        }
        if(mp[need1]==0) tf[i]=1;
        // for(auto j:se) cout<<j<<" ";
        // cout<<endl;
        // if(!se.count(need2)) tf[i]=1;
    }
    for(int i=1;i<=m;i++){
        if(tf[i]) printf("1");
        else printf("0");
    }
    puts("");
}
/*
输入：
7 14 1 7
1 2 5
1 3 6
1 4 5
2 3 2
2 5 3
3 2 2
3 4 3
3 5 3
3 6 7
4 6 5
5 6 1
6 5 1
5 7 8
6 7 7

输出：
14

*/

int main(){
    int _=1;
    cin>>_;
    while(_--){
        __();
    }
}