#include <iostream>
using namespace std;
#define MaxInt 1e8
#define MVNum 100//最大顶点数
typedef char VerTexType;
typedef int ArcType;
bool vis[MVNum];typedef struct {VerTexType vexs[MVNum];//顶点表ArcType arcs[MVNum][MVNum];//邻接矩阵int vexnum, arcnum; //图的当前点数和边数
} AMGraph;int LocateVex(AMGraph G, VerTexType u) {for (int i = 0; i < G.vexnum; i++) {if (u == G.vexs[i])return i;}return -1;
}//采用邻接矩阵表示法创建无向图
void CreateUDN(AMGraph &G) {cin >> G.vexnum >> G.arcnum;for (int i = 0; i < G.vexnum; i++)cin >> G.vexs[i];//依次输入点的信息memset(G.arcs, 0, sizeof(G.arcs));//初始化边的权值，均设置为最大值????????
//	for(int i = 0;i<G.vexnum;i++)
//		for (int j = 0;j<G.vexnum;j++)
//			G.arcs[i][j] = MaxInt;for (int k = 0; k < G.arcnum; k++) {VerTexType v1, v2;int w;cin >> v1 >> v2 >> w;int i = LocateVex(G, v1);int j = LocateVex(G, v2);G.arcs[i][j] = w;G.arcs[j][i] = G.arcs[i][j];}
}void DFS(AMGraph G, int v) {cout << G.vexs[v];vis[v] = true;for (int i = 0; i < G.vexnum; i++) {if (G.arcs[v][i] != 0 && !vis[i])DFS(G, i);}
}int main() {AMGraph G;CreateUDN(G);DFS(G, 0);return 0;}