#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

int N,M,K,G[3010][3010],q[100010],pre[100010],dist[100010];
bool Map[3010][3010];

void print(int u)
{
	if(u)
		print(pre[u]);
	else
		return;
	printf("%d ",q[u]);
}

bool check(int x,int y)
{
	if(G[q[pre[x]]][q[x]]==y)
		return false;
	return true;
}

void bfs()
{
	int head=0,tail=1;
	q[1]=1;
	while(head!=tail)
	{
		head++;
		int u=q[head];
		if(u==N)
		{
			printf("%d\n",dist[head]);
			print(head);
			return;
		}
		for(int i=1;i<=N;i++)
			if(i!=u&&Map[i][u]&&check(head,i))
			{
				tail++;
				q[tail]=i;
				pre[tail]=head;
				dist[tail]=dist[head]+1;
				Map[i][u]=false;
			}
	}
}

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++)
	{
		int a,b;
		scanf("%d%d",&a,&b);
		Map[a][b]=true;
		Map[b][a]=true;
	}
	for(int i=1;i<=K;i++)
	{
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		G[a][b]=c;
	}
	bfs();
	return 0;
}