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;
const int N = 200005;
int n, w[N], rt, sz[N];
vector<pair<int, int>> v[N];
int ans1;
double sum, d[N], sd, ans2 = DBL_MAX;
bool vis[N];
void dfs(int pos, int fa, int s) {
  sz[pos] = 1;
  int cur = 0;
  for (auto &i : v[pos])
    if (!vis[i.first] && i.first != fa)
      dfs(i.first, pos, s), sz[pos] += sz[i.first], cur = max(cur, sz[i.first]);
  cur = max(cur, n - sz[pos]);
  if (cur <= s / 2) rt = pos;
}
void calc(int pos, int fa, int t, int ss) {
  sum += pow(ss, 1.5) * w[pos];
  d[t] += pow(ss, 0.5) * 1.5 * w[pos];
  for (auto &i : v[pos])
    if (i.first != fa) calc(i.first, pos, t, ss + i.second);
}
void dfs(int pos, int s) {
  dfs(pos, 0, s);
  pos = rt;
  dfs(pos, 0, s);
  if (vis[pos]) return;
  vis[pos] = 1;
  sum = sd = 0;
  for (auto &i : v[pos])
    d[i.first] = 0, calc(i.first, pos, i.first, i.second), sd += d[i.first];
  if (sum < ans2) ans1 = pos, ans2 = sum;
  for (auto &i : v[pos])
    if (sd - 2 * d[i.first] < 0) {
      dfs(i.first, sz[i.first]);
      break;
    }
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> w[i];
  int t1, t2, t3;
  for (int i = 1; i < n; i++)
    cin >> t1 >> t2 >> t3, v[t1].push_back({t2, t3}), v[t2].push_back({t1, t3});
  dfs(1, n);
  printf("%d %.10lf\n", ans1, ans2);
  return 0;
}
