3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
inline int read() {
  register int X = 0;
  register char ch = 0;
  while (ch < 48 || ch > 57) ch = getchar();
  while (ch >= 48 && ch <= 57) X = X * 10 + (ch ^ 48), ch = getchar();
  return X;
}
int n, w[205000];
vector<int> g[205000], l[205000];
int siz[205000], t[205000], tn, mp[205000];
void pfs(int u) {
  siz[t[++tn] = u] = 1;
  for (int i = 0, v; i < g[u].size(); i++)
    if (!siz[v = g[u][i]]) {
      pfs(v);
      mp[u] = max(mp[u], siz[v]);
      siz[u] += siz[v];
    }
}
int getrt(int u) {
  tn = 0;
  pfs(u);
  int al = siz[u], ret = 0;
  for (int i = 1, v; i <= tn; i++) {
    v = t[i];
    mp[v] = max(mp[v], al - siz[v]);
    if (mp[v] < mp[ret]) ret = v;
  }
  for (int i = 1, v; i <= tn; i++) mp[t[i]] = siz[t[i]] = 0;
  return ret;
}
double sum, d[205000];
void dfs(int u, int fa, int len) {
  sum += sqrt(len) * w[u];
  for (int i = 0, v; i < g[u].size(); i++)
    if ((v = g[u][i]) != fa) dfs(v, u, len + l[u][i]);
}
int ans1, ans2;
void solve(int u) {
  siz[u] = 1;
  double o = 0.0;
  for (int i = 0, v; i < g[u].size(); i++) {
    sum = 0;
    dfs(v = g[u][i], u, l[u][i]);
    d[i] = sum;
    o += sum;
  }
  for (int i = 0; i < g[u].size(); i++)
    if (o < d[i] * 2.0) {
      if (siz[u] && siz[g[u][i]]) {
        ans1 = u;
        ans2 = g[u][i];
        return;
      }
      solve(getrt(g[u][i]));
      return;
    }
  ans1 = ans2 = u;
}
void cfs(int u, int fa, int len) {
  sum += pow(len, 1.5) * w[u];
  for (int i = 0, v; i < g[u].size(); i++)
    if ((v = g[u][i]) != fa) cfs(v, u, len + l[u][i]);
}
int main() {
  n = read();
  mp[0] = n + 1;
  for (int i = 1; i <= n; i++) w[i] = read();
  for (int i = 1, fr, to, len; i < n; i++) {
    fr = read();
    to = read();
    len = read();
    g[fr].push_back(to);
    l[fr].push_back(len);
    g[to].push_back(fr);
    l[to].push_back(len);
  }
  solve(getrt(1));
  double sum1 = 0.0, sum2 = 0.0;
  sum = 0;
  cfs(ans1, 0, 0);
  sum1 = sum;
  sum = 0;
  cfs(ans2, 0, 0);
  sum2 = sum;
  if (sum2 < sum1)
    printf("%d %.10lf", ans2, sum2);
  else
    printf("%d %.10lf", ans1, sum1);
  return 0;
}
