#include <cstdio>
#include <cstring>
#include <queue>
#include <iostream>
using namespace std;
#define INF 0X7FFFFFFF
int head[1005],cnt,Min,ind;
struct node{
int to;
int weight;
int next;
}edge[20005];
struct node1{
int to,distance;
node1(int x,int y):to(x),distance(y){}
bool operator< (const node1 a)const{
return distance>a.distance;
}
};
void Add(int x,int y,int w){
cnt++;
edge[cnt].to=y;
edge[cnt].weight=w;
edge[cnt].next=head[x];
head[x]=cnt;
}
void Dijkstra(int n){
int dis[n+1],pre[n+1],book[n+1];
priority_queue<node1> q;
for(int i=0;i<=n;i++){
dis[i]=INF;
}
dis[n]=0;
memset(book,0,sizeof(book));
q.push(node1(n,0));
while(!q.empty()){
struct node1 a=q.top();
q.pop();
if(book[a.to]){
continue;
}
book[a.to]=1;
for(int i=head[a.to];i;i=edge[i].next){
if(dis[edge[i].to]>a.distance+edge[i].weight){
dis[edge[i].to]=a.distance+edge[i].weight;
q.push(node1(edge[i].to,dis[edge[i].to]));
pre[edge[i].to]=a.to;
}
else if(dis[edge[i].to]==a.distance+edge[i].weight){
pre[edge[i].to]=min(pre[edge[i].to],a.to);
}
}
}
Min=dis[0];
ind=pre[0];
return;
}
int main(){
int c,n,m,flag;
int x,y,w;
cin>>c;
for(int i=1;i<=c;i++){
cnt=0;
flag=0;
memset(head,0,sizeof(head));
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>x>>y>>w;
Add(y,x,w);
}
Dijkstra(n+1);
if(Min==INF){
cout<<-1<<endl;
continue;
}
for(int j=head[n+1];j;j=edge[j].next){
if(edge[j].weight==Min&&edge[j].to==0){
cout<<0<<endl;
flag=1;
}
}
if(!flag){
cout<<ind<<endl;
}
}
return 0;
}
//之前一直用搜索做单源最短路径的,在ACM上其实容易超时,果断采用Dijkstra算法,而且用到优先队列