/*
Author: haze
2023/11/15
11:19
*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int (i) = (l); (i) <= (r); ++(i))
#define drep(i, r, l) for(int (i) = (r); (i) >= (l); --(i))
#define ll long long
#define LL __int128
using namespace std;

inline ll read() {
    char ch = getchar();
    ll s = 0;
    bool w = 0;
    while (!isdigit(ch)) {
        if (ch == '-')w = 1;
        ch = getchar();
    }
    while (isdigit(ch))s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
    return w ? -s : s;
}

inline char rc() {
    char ch = getchar();
    while (1) {
        if (ch >= '!' && ch <= '~')return ch;
        ch = getchar();
    }
}

template<class T1, class T2>
T1 min(T1 AA, T2 BB) { return AA > BB ? BB : AA; }

template<class T1, class T2>
T1 max(T1 AA, T2 BB) { return AA < BB ? BB : AA; }

const int itinf = 1e9;
const ll llinf = 4e18;
const int mod = 1000000007;
const int N = 500009;

struct augment_path {
    vector<vector<int> > g;
    vector<int> pa;  // 匹配
    vector<int> pb;
    vector<int> vis;  // 访问
    int n, m;         // 两个点集中的顶点数量
    int dfn;          // 时间戳记
    int res;          // 匹配数

    augment_path(int _n, int _m) : n(_n), m(_m) {
        assert(0 <= n && 0 <= m);
        pa = vector<int>(n, -1);
        pb = vector<int>(m, -1);
        vis = vector<int>(n);
        g.resize(n);
        res = 0;
        dfn = 0;
    }

    void add(int from, int to) {
        assert(0 <= from && from < n && 0 <= to && to < m);
        g[from].push_back(to);
    }

    bool dfs(int v) {
        vis[v] = dfn;
        for (int u : g[v]) {
            if (pb[u] == -1) {
                pb[u] = v;
                pa[v] = u;
                return true;
            }
        }
        for (int u : g[v]) {
            if (vis[pb[u]] != dfn && dfs(pb[u])) {
                pa[v] = u;
                pb[u] = v;
                return true;
            }
        }
        return false;
    }

    int solve() {
        while (true) {
            dfn++;
            int cnt = 0;
            for (int i = 0; i < n; i++) {
                if (pa[i] == -1 && dfs(i)) {
                    cnt++;
                }
            }
            if (cnt == 0) {
                break;
            }
            res += cnt;
        }
        return res;
    }
};

void solve(){
    int n = read(), m = read(), sumdeg = 0;
    vector<int>lim(n), deg(n);
    vector<array<int, 2>>edge(m), rg(n);
    irep(i, 0, n - 1)lim[i] = read();
    irep(i, 0, m - 1){
        int u = read() - 1, v = read() - 1;
        edge[i] = {u, v};
        deg[u] ++, deg[v] ++;
    }
    irep(i, 0, n - 1)lim[i] = min(lim[i], deg[i]), sumdeg += lim[i];
    int st = 0;
    vector<int>id(sumdeg);
    irep(i, 0, n - 1){
        rg[i] = {st, st + lim[i] - 1};

        irep(j, st, st + lim[i] - 1)id[j] = i;

        st += lim[i];
    }
    //for(auto [l, r] : rg)cerr << l << ' ' << r << endl;
    augment_path G(sumdeg, m);
    irep(k, 0, m - 1){
        auto [u, v] = edge[k];
        auto [li, ri] = rg[u];
        auto [lj, rj] = rg[v];
        irep(i, li, ri){
            G.add(i, k);
        }
        irep(j, lj, rj){
            G.add(j, k);
        }
    }

    int ans = G.solve();
    printf("%d\n",m - ans);
    irep(i, 0, m - 1){
        int mt = G.pb[i];
        auto [u, v] = edge[i];
        if(mt == -1 || u == id[mt])putchar('1');
        else putchar('0');
    }
    putchar('\n');
}

int main() {
    int T = read();
    while(T --){
        solve();
    }
    return 0;
}
/*
 2
 4 5
 0 1 1 5
 1 2
 1 3
 2 3
 3 2
 4 4
 3 2
 0 0 2
 1 3
 3 2
 */