#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 3000 + 10;
int n, m, k, a, b, c;
bool G[N][N];
vector<int> f[N][N];
int main() {
    freopen("patha.in", "r", stdin);
    freopen("patha.out", "w", stdout);
    scanf("%d %d %d", &n, &m, &k);
    for(int i=1; i<=m; i++) {
        scanf("%d %d", &a, &b);
        G[a][b] = G[b][a] = 1;
        if(G[1][n]) {
            printf("1\n1 %d\n", n);
            return 0;
        }
    }
    for(int i=1; i<=m; i++) {
        scanf("%d %d %d", &a, &b, &c);
        f[a][b].push_back(c);
    }
    return 0;
}