#include <bits/stdc++.h>

using i64 = long long;

void solve() {
    int n, m;
    std::cin >> n >> m;
    
    std::vector<int> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    
    std::vector<std::vector<int>> adj(n);
    std::vector<int> u(m), v(m);
    for (int i = 0; i < m; i++) {
        std::cin >> u[i] >> v[i];
        u[i]--, v[i]--;
        adj[u[i]].push_back(i);
        adj[v[i]].push_back(i);
    }
    
    std::vector<int> yx(m, -1);
    std::vector<bool> vis(n);
    auto find = [&](auto self, int x) -> bool {
        vis[x] = true;
        for (auto y : adj[x]) {
            if (yx[y] == -1 || (!vis[yx[y]] && self(self, yx[y]))) {
                yx[y] = x;
                return true;
            }
        }
        return false;
    };
    int ans = m;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < a[i]; j++) {
            if (find(find, i)) {
                ans--;
                vis.assign(n, false);
            } else {
                break;
            }
        }
    }
    std::cout << ans << "\n";
    for (int i = 0; i < m; i++) {
        std::cout << (yx[i] == -1 || yx[i] == v[i] ? 0 : 1);
    }
    std::cout << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}