#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;

void BFS(vector<int> adj[], int visited[], int s)
{
    queue<int> Q;
    Q.push(s);
    visited[s] = 0;
    
    while(!Q.empty())
    {
        int node = Q.front();
        Q.pop();
        
        for(int i = 0; i < adj[node].size(); ++i)
        {
            if(visited[adj[node][i]] == -1)
            {
                visited[adj[node][i]] = 0;
                visited[adj[node][i]] = 6 + visited[node];
                Q.push(adj[node][i]); // Pushing all the neighbouring nodes to the queue
            }
        }
    }
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    int q;
    cin >> q;
    for(int i = 0; i < q; ++i)
    {
        int n, m, u, v, s;
        cin >> n >> m;
        vector<int> adj[n+1];
        for(int j = 1; j <= m; ++j)
        {
            cin >> u >> v;
            adj[u].push_back(v);
            adj[v].push_back(u);
        }
        cin >> s;
        int visited[n+1];
        for(int i = 1; i <= n; ++i)
            visited[i] = -1;
        
        BFS(adj, visited, s);
        
        for(int i = 1; i <= n ; ++i)
        {
            if(visited[i] != 0)
            cout << visited[i] << " ";
        }
        cout << endl;
    }
    
    return 0;
}

from collections import defaultdict


class Graph:
    def __init__(self, n):
        self.graph = defaultdict(list)
        self.n_nodes = n

    def connect(self, u, v):
        self.graph[u].append(v)
        self.graph[v].append(u)

    def bfs(self, s):
        queue = [s]
        dists = {s: 0}
        while queue:
            n = queue.pop(0)
            for i in self.graph[n]:
                if i not in dists:
                    dists[i] = dists[n] + 6
                    queue.append(i)
        return dists

    def find_all_distances(self, s):
        dists = self.bfs(s)
        ans = []
        for node in range(self.n_nodes):
            if node == s:
                continue
            elif node not in dists:
                ans.append(-1)
            else:
                ans.append(dists[node])
        print(" ".join(map(str, ans)))

function processData(input) {
    //Enter your code here
    input = input.split('\n')
    let q = parseInt(input.shift())
    for (let query = 0; query < q; query++) {
        let nm = input.shift()
        let n = parseInt(nm.split(' ')[0])
        let m = parseInt(nm.split(' ')[1])
        let edges = []
        for (let i = 0; i < n + 1; i++) {
            edges.push([])
        }
        for (let i = 0; i < m; i++) {
            let edge = input.shift().split(' ').map(e => parseInt(e))
            edges[edge[0]].push(edge[1])
            edges[edge[1]].push(edge[0])
        }
        let root = parseInt(input.shift())
        let feelers = [root]
        let distances = Array(n + 1).fill(-1)
        distances[root] = 0
        while (feelers.length > 0) {
            let length = feelers.length
            for (let i = 0; i < feelers.length; i++) {
                let feeler = feelers[i]
                for (let connected of edges[feeler]) {
                    if (distances[connected] != -1) {
                        continue
                    }
                    distances[connected] = distances[feeler] + 6
                    feelers.push(connected)
                }
            }
            feelers = feelers.slice(length)
        }
        distances = [...distances.slice(1, root), ...distances.slice(root + 1)]
        console.log(distances.join(' '))
    }
} 

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
    _input += input;
});

process.stdin.on("end", function () {
   processData(_input);
});