#include <bits/stdc++.h>
using namespace std;
const int nx=3e5+5, kx=19;
int n, m, x, t[nx], cnt, ans[nx], used[nx], sz[nx], pa[nx][kx], lvl[nx];
vector<int> vl[nx], add[nx], rem[nx];
vector<pair<int, int>> ed(nx), d[nx];
set<int> s;
void dfs(int u, int p)
{
lvl[u]=lvl[p]+1;
pa[u][0]=p;
for (int i=1; i<kx; i++) pa[u][i]=pa[pa[u][i-1]][i-1];
for (auto [v, w]:d[u]) if (v!=p) dfs(v, u);
}
void dfssz(int u, int p)
{
sz[u]=(int)add[u].size()+(int)rem[u].size()+1;
for (auto [v, w]:d[u]) if (v!=p) dfssz(v, u), sz[u]+=sz[v];
}
int lca(int u, int v)
{
if (lvl[u]>lvl[v]) swap(u, v);
for (int i=kx-1; i>=0; i--) if (lvl[pa[v][i]]>=lvl[u]) v=pa[v][i];
if (u==v) return u;
for (int i=kx-1; i>=0; i--) if (pa[u][i]!=pa[v][i]) u=pa[u][i], v=pa[v][i];
return pa[u][0];
}
void dfsadd(int u, int p)
{
for (auto [v, w]:d[u]) if (v!=p) dfsadd(v, u);
for (auto tmp:add[u]) s.insert(tmp);
for (auto tmp:rem[u]) s.erase(tmp);
}
void sack(int u, int p, int idx, int del)
{
pair<int, int> hv={-1, -1};
for (auto [v, w]:d[u]) if (v!=p) hv=max(hv, {sz[v], v});
for (auto [v, w]:d[u]) if (v!=p&&v!=hv.second) sack(v, u, w, 1);
for (auto [v, w]:d[u]) if (v!=p&&v==hv.second) sack(v, u, w, 0);
if (!del) for (auto [v, w]:d[u]) if (v!=p&&v!=hv.second) dfsadd(v, u);
for (auto tmp:add[u]) s.insert(tmp);
for (auto tmp:rem[u]) s.erase(tmp);
if (s.size()>0&&*s.begin()<idx) used[idx]=1, vl[*s.begin()].push_back(idx);
if (del) s.clear();
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>m;
for (int i=1; i<=m; i++) cin>>ed[i].first>>ed[i].second;
for (int i=1; i<n; i++) cin>>x, t[x]=1, d[ed[x].first].push_back({ed[x].second, x}), d[ed[x].second].push_back({ed[x].first, x});
dfs(1, 1);
for (int i=1; i<=m; i++) if (!t[i]) add[ed[i].first].push_back(i), add[ed[i].second].push_back(i), rem[lca(ed[i].first, ed[i].second)].push_back(i);
dfssz(1, 1);
sack(1, 1, 0, 0);
//for (int i=1; i<=n; i++) cout<<i<<' '<<sz[i]<<'\n';
for (int i=1; i<=m; i++)
{
if (t[i]&&!used[i]) ans[i]=++cnt;
else if (!t[i])
{
sort(vl[i].begin(), vl[i].end());
for (auto tmp:vl[i]) ans[tmp]=++cnt;
ans[i]=++cnt;
}
}
for (int i=1; i<=m; i++) cout<<ans[i]<<' ';
}
/*
4 6
2 3
3 4
2 4
1 3
1 4
1 2
1 2 6
*/
